能量高效的传感器网络虚拟骨干网构造算法

Energy-efficient algorithm for virtual backbone construction in wireless sensor network

提出一种新的可用于无线自组传感器网络路由中的能量高效的虚拟骨干网构造算法。该算法将网络中的节点按照地理距离最近的原则划分为若干簇,簇头与簇成员的距离为k-hop,增大了簇的规模,减少了通信开销;利用最小连通支配集理论优化簇内结构,选择新的参数作为权值,在保证骨干网规模的同时,优先选择剩余能量高的节点担任骨干节点,均衡了网络的能量消耗,从而延长了网络寿命。仿真结果表明,该算法构造的虚拟骨干网规模较小,对降低路由复杂度、延长传感器网络寿命有较好的效果。

An energy-efficient algorithm for virtual backbone construction that could be used for Wireless Sensor Network （WSN） routing was proposed. The network nodes were divided into a number of clusters according to the geographical distance between them, the distance of the cluster head and members was k - hop. While the size of cluster was increased, the cost of communication was reduced. Using the smallest connected dominating set theory to optimize within the cluster structure, choosing a new parameter value as a right, making the nodes with higher energy be key nodes while guarantee the size of the network backbone, the energy consumption was balanced, and the life of the network was prolonged. Simulation results show that the algorithm can reduce the network scale and routing complexity, and extend the life of WSN.