基于簇头距离和能量的优化LEACH协议

LEACH(low energy adaptive clustering hierachy)路由协议通过循环随机选举簇头节点的方式均衡网络能耗.但当选簇头的节点能量剩余较少或距离基站较远时会过早死亡,从而导致网络运行不稳定,通过在簇头选择过程中加入待选簇头节点的剩余能量平均值及标准差、节点与基站距离等参数对其改进处理,可提高网络稳定性.但若出现极大簇或极小簇,则会导致网络生命周期缩短.针对这一问题提出一种基于簇头距离和能量的优化LEACH算法,在成簇过程中加入簇头节点的能量和节点距各簇头的距离等参考量对成簇过程进行优化.MATLAB仿真结果表明,在节点均匀分布的网络中,该改进算法能够在提高网络稳定性的基础上有效延长网络生存周期.

Optimized LEACH protocol based on distance and energy of cluster head

The LEACH routing protocol balances the network energy consumption by selecting cluster heads circularly and randomly. However, when the selected cluster head has less residual energy or is far away from the base station, it will die prematurely, resulting in unstable network operation. We can improve it by considering the mean and standard deviation of residual energy of the node and the distance between the node and the base station. This can improve the stability of the network. But it will shorten the network lifetime if there are extremely large or small clusters. Aiming at this problem, an optimized LEACH protocol based on distance and energy of cluster head is proposed. It can optimize the clustering process by adding the residual energy of cluster head and distance between member nodes and cluster heads. The simulation results with MATLAB show that the improved algorithm can effectively prolong the network lifetime based on the improvement of network stability in the network with uniform distribution of nodes.