无线传感器网络中基于能量约束的簇首多跳算法

Multiple-Hop Routing Algorithm of Cluster Heads Based on Energy-Restriction for Wireless Sensor Networks

针对无线传感器网络节点的能量有限的特点,在LEACH协议的基础上,提出了一种以剩余能量为参数限制中间节点选择的簇首多跳算法。算法在生成包括基站在内的所有簇首节点的最小生成树的同时,考虑作为中间节点转发数据的簇首的剩余能量,使簇首之间形成一个多跳的最优路径与基站进行通信,并且避免使用低能量节点。仿真结果表明,新提出的路由算法比LEACH更能减少和均衡能量消耗,从而延长了网络的生命周期。

Considering the limited energy of sensor nodes in wireless sensor network , multiple-hop routing algorithm of cluster heads based on LEACH is proposed, which introduces the restriction factors of residual energy into the selection of the interim nodes, the novel algorithm generates a minimum spanning tree including base station and the cluster heads. And according to the residual energy of cluster heads, an interim node is chosen out by the algorithm from all of the head nodes. Then a shortest inter-cluster multiple-hop routing is formed for communication between cluster heads and the base station,which avoids to use low energy cluster heads . Simulation results demonstrate that compared with LEACH this novel protocol is more efficient to save energy of consumption and prolong the living time of the whole network.