无线传感器网络最小覆盖能量优化算法

The Minimum Coverage Energy Optimization Algorithms in Wireless Sensor Network

在无线传感器网络中,位于基站周围的节点由于负责所有探测数据的转发任务而能量消耗水平较高。为了均衡基站周围节点的能量消耗,提出一种合理有效的节点轮换休眠机制。使得网络中大量冗余节点处于休眠状态,从而减少基站周围重要节点的负载。基于这种想法提出了冗余节点判定定理,基于Voronoi图寻找最大可休眠节点集,设计了最小连通覆盖算法(FBSW)寻找网络中可休眠的冗余节点,有效地延长网络的生命周期。仿真结果证明,该算法的运行复杂度优于贪婪算法,由于冗余节点轮换休眠,整个网络的能量节约了20.01%以上。

Nodes around the base station are charged with the task for transferring a large of data to the base stationin wireless sensor networks. Therefore,these nodes consume more energy than others. In order to balance the energyconsumption of nodes around the base station,this paper puts forword a reasonable and effective node rotation mech-anism. A large number of redundant nodes turn to dormancy so that the load of nodes is reduced around the base sta-tion. A redundant nodes decision theorem is proposed based on the mechanism. The maximum dormant node set isfound based on the Voronoi diagram. The Minimum Connected Coverage algorithm（FBSW）is proposed to find outthe redundant nodes which can be dormant and to prolong the network lifetime. The Simulation results show that theoperation complexity of the FBSW algorithm is superior to the Greedy algorithm. On account of the redundant nodeswhich turn to dormancy,the energy of the network is saved by 21.01%.