基于LEACH的节能高效路由算法的研究

Research on the Energy-saving and Efficient Routing Algorithm Based on LEACH

本文分析了LEACH协议,指出其在簇头划分、簇头选择等方面存在的不足,提出一种基于LEACH的高效节能路由算法。该算法设置计数器来进行簇的划分,通过减少计算来降低节点能量消耗,通过对节点剩余能量的对比选出新簇头,保证了网络的稳定性。在此基础上利用贪心算法将簇头构成一条贪心链,形成多跳路由结构,进一步达到节能的目的。NS2仿真的结果表明该协议具有较好的节能性能,能够均衡节点能量的消耗,延长网络生命周期。

This paper analyzes LEACH protocol,points out the shortcomings in the partition of cluster heads 、the selection of cluster heads and so on,and proposes an high efficiency and energy saving routing algorithun bases on LEACH.The algorithm sets up counter to divide clusters,lowers consumption of node energy by reducing calculation,selects new cluster head by comparing the surplus node energy,all these ensure the stability of the network.Based on this,cluster heads form a greedy chain using greedy algorithm,then form multiple hops routing structure and further to achive the purpose of energy saving.The result of NS2 simulation shows that LEACH protocol has good performance in saving energy 、balancing node energy consumption and prolonging network life cycle.