LEACH协议簇头选择算法的改进

An Improved Algorithm for Selecting Cluster-heads in LEACH

LEACH协议存在簇头节点个数和位置分布不稳定的现象。在改进的LEACH-H协议在簇头节点的选举过程中,充分考虑了簇头节点剩余能量因素,设定了簇头的能量阀值,防止了低能量的节点成为簇头。在此基础上引进簇头调整过程,该过程通过排除紧密邻居簇头和增加必要的簇头,在一定程度上解决了LEACH协议存在的问题,从而达到均衡网络能量消耗,延长生存期的目的。网络仿真证明了新算法的可行性。

In LEACH, the number and the locations of cluster-heads are both unstable. In order to avoid low energy cluster-head, in the process of cluster-head electing, LEACH-H takes remaining energy into consideration, designs energy threshold of cluster-head. A cluster-head adjusting phase is devised, which can eliminate close neighbor cluster-heads and necessarily add cluster-heads. This phase will solve the above problems to a certain extent, attain the load equilibrium and further lengthen the network lifetime. The simulation results show that the new algorithm is feasible.