一种WSN中的能耗优化动态路由算法

Novel dynamic routing algorithm for energy optimization in WSN

根据无线传感器网络中因节点有效传输半径对路由选择的制约,提出基于最小生成树(MST)的改进分簇多跳路由算法,改善因路由选择对网络能耗的影响.该算法利用Voronoi图的泊松过程特性优化簇首节点数,并结合MST动态调整簇内外节点的路由发现实现网络能耗优化.仿真结果表明,该算法在开销容忍的前提下,网络负载均衡,并与相同仿真条件下基于LEACH的分层多跳算法相比,更有效地延长了网络寿命,且降低了计算复杂度.

According to the effect of limited radio range of sensor nodes upon routing in wireless sensor networks（WSN）,an improved multi-hop clustering algorithm based on the minimal structure tree（MST） is proposed to ameliorate the problems of energy consumption because of routing.This algorithm optimizes cluster heads according to the characteristic in the poisson process of the voronoi diagram,and establishes the MST as sensor nodes＇ dynamic routing for optimizing energy consumption in WSN.This algorithm establishes the MST as sensor nodes＇ routing and then optimizes the distributed density of cluster heads according to the characteristic in the poisson process of the voronoi diagram.Simulation results indicate that the novel algorithm is able to make energy load balanced at the premise of the cost tolerance,prolong the life-span of the networks effectively and reduce the time complexity compared with multi-hop hierarchy algorithms based on low-energy adaptive cluster hierarchy（LEACH） under the same simulation conditions.