LEACH Algorithm Improvement Based on Cluster Head Selection
In order to solve the problem of LEACH Algorithm can not guarantee the larger residual energy node absolutely ware elected as cluster head,and it consumes large amounts of energy for double counting of cluster head election,at the same time,the influence of the node distance for cluster head election is not included.The improved LEACH algorithm has solved the problems veηwell, it makes a use of cluster heads projection to decrease the number of cluster competition by combining with the optimal cluster head selection algorithm,which can reduce the node energy consumption,then to achieve equilibrium ne何ork energy consumption and prolong the survival time of the network.And the experimental results shown that the improved LEACH algorithm balanced the energy consumption of the entire network,significantly reduced the power consumption of the nodes in the monitoring area,delayed the first death nodes appear on the number of rounds,and prolonged the life cycle ofmonitoring network.
the Improvement of LEACH algorithm Optimal cluster head selection Cluster heads forecasting mechanism Time schedule
Huan Zhou Minsheng Tan Qunzhong Peng Yangwei Li
School of Computer Science and Technology, University of South China, Hengyang Hunan, 421001,China
国内会议
长沙
英文
1-7
2014-09-21（万方平台首次上网日期，不代表论文的发表时间）