一种基于优化分簇数量和节点能量的LEACH改进算法

An Improved LEACH Algorithm Based on Energy Clustering Optimization

针对LEACH算法中随机等概率选举簇头导致节点能耗不均、网络生存周期短的问题，提出一种基于优化分簇数量和节点能量的LEACH改进算法。新算法引入虚拟单元格划分节点位置、动态优化簇头的数量和改变簇头选举方式解决节点能耗不均的问题。仿真实验结果表明，新算法在节点能量的利用率方面优于LEACH算法48％，能够有效均衡网络能耗，延长网络的生存周期。

Aming at the problemof uneven energy consumption and short lifetime network resulting from the random equal probability election of cluster head in LEACH algorithm, proposes an improved algorithm based on optimized clustering and node energy. The new algorithm introduces the virtual cell, divides the node position, dynamically optimizes the number of cluster heads and changes the cluster head election mode to solve the problem of uneven energy consumption in the nodes of the three elements. Simulation results show that the new algorithm is superior to the LEACH algorithm 48% in the utilization of node energy, effectively balancing the network energy consumption and prolonging the network life cycle.