The Improved LEACH-C Protocol with the Cuckoo Search Algorithm
- https://doi.org/10.2991/cnct-16.2017.73How to use a DOI?
- LEACH-C protocol, Cuckoo Search Algorithm, multidimensional space, discrete distribution
LEACH-C routing protocol chooses the cluster head by simulated annealing algorithm, although the simulated annealing algorithm can optimize network communication distance, however, the convergence of annealing algorithm is very slow. Improved LEACH-C uses the cuckoo search algorithm to optimize network communication distance. To meet discrete distribution of node, the continuous L,vy flight length is discretized. To increase the convergent speed, the annealing probability calculation introduced to the Cuckoo Search Algorithm. The simulation result shows that the improved LEACH-C Algorithm has good convergence speed, reaches low stable objective function values. From the improved LEACH-C algorithm, the cluster heads distribution is relatively uniform, the total WSNs energy consumption is low, and the node death rate gets low.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Yun-sheng GE AU - Jie KONG AU - Kun TANG PY - 2016/12 DA - 2016/12 TI - The Improved LEACH-C Protocol with the Cuckoo Search Algorithm BT - Proceedings of the International Conference on Computer Networks and Communication Technology (CNCT 2016) PB - Atlantis Press SP - 530 EP - 536 SN - 2352-538X UR - https://doi.org/10.2991/cnct-16.2017.73 DO - https://doi.org/10.2991/cnct-16.2017.73 ID - GE2016/12 ER -