基于LEACH协议的簇头选举改进算法

摘要

以减小LEACH协议簇形成过程中的能量消耗为目的,提出一种改进的簇头选举算法LEACH-ECHC.当所有簇头的剩余能量最小值小于某个阈值时,进行全网选举;当簇头能量小于该簇剩余能量的平均值时,进行簇内选举,并对簇头产生的阈值进行优化.仿真结果显示,LEACH-ECHC算法有更高的能量有效性,可以延长网络寿命,使节点能耗更均衡.%In order to reduce the energy of clustering in Low Energy Adaptive Clustering Hierarchy(LEACH), this paper proposes an improved cluster-head election.algorithm namely Election of Cluster Heads in the Cluster(LEACH-ECHC).If the residual energy of each cluster-head is lower than the given threshold, cluster-head election is done in the whole network.If the cluster-head's residual energy is lower than the average residual energy, the election is done in the cluster.And the selection method of the threshold for electing cluster-head is optimized.Simulation results demonstrate that LEACH-ECHC has better energy efficiency, prolongs network lifetime, and makes node energy consumption more balanced.