摘要
针对LEACH算法中簇首的随机选举导致节点能量分布不均衡的问题,本文提出了一种新的簇首自适应让位分簇算法(Cluster Head Adaptive Abdication,CHAA)。该算法在满足节省能量距离门限的前提下,重新定义了LEACH算法中阀值的计算公式,并定义了一个能量门限来衡量簇首节点的健康度,使那些趋于衰亡的CH找到合适的继任者,并选取距离CH较近的节点担当CN,以保证数据传输的可靠性。仿真结果表明,CHAA算法能够实现能量的均衡,在有效延长网络生存时间的同时,相应的提高了网络数据吞吐量,具有一定的应用价值。
For the random of cluster head election in LEACH,which makes unbalance of energy distribution among nodes and reduces the life expectancy and network transmission throughput,it puts forward a new cluster head adaptive abdication（ CHAA） algorithm. In which it redefines the threshold formula in LEACH in the premise of meeting the energy saving distance threshold,and defines an energy threshold to measure the health of the CH,letting the CH who tend to decline to find a suitable successor,and selecting the nearest as CN. So it can ensure the reliability of data transmission. Simulation results show that,CHAA algorithm can achieve energy balance. For the effectively extending of the network lifetime and increasing of network throughput,it has a certain application.
出处
《邵阳学院学报（自然科学版）》
2016年第3期56-61,共6页
Journal of Shaoyang University：Natural Science Edition
基金
湖南人文科技学院校级青年基金项目(2009QN04)
