LEACH Algorithm Improvement Based on Cluster Head Selection
Min-Sheng Tan, Chen-Cheng Wang, Miao Guo, Ting Xiang, Qun-Zhong Peng, Yang-Wei Li
Available Online December 2016.
- https://doi.org/10.2991/icwcsn-16.2017.30How to use a DOI?
- the improvement of LEACH algorithm; optimal cluster head selection; cluster heads forecasting mechanism; time schedule
- In order to solve the problem of LEACH Algorithm cannot guarantee the larger residual energy node absolutely were 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 very 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 network energy consumption and prolong the survival time of the network. And the experimental results are 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 dead nodes appear on the number of rounds, and prolonged the life cycle of monitoring network.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Min-Sheng Tan AU - Chen-Cheng Wang AU - Miao Guo AU - Ting Xiang AU - Qun-Zhong Peng AU - Yang-Wei Li PY - 2016/12 DA - 2016/12 TI - LEACH Algorithm Improvement Based on Cluster Head Selection PB - Atlantis Press SP - 136 EP - 141 SN - 2352-538X UR - https://doi.org/10.2991/icwcsn-16.2017.30 DO - https://doi.org/10.2991/icwcsn-16.2017.30 ID - Tan2016/12 ER -