The Adaption of the Cuckoo Search Algorithm Applied in the LEACH-C Protocol

Cuckoo search algorithm has got extensive attention and application as a swarm intelligent optimization algorithm. Levy flight can expand the search area and jump out of the local optimal solution so as to improve the convergence speed of algorithm. But Levy flight track is continuous. To adapt the cuckoo search algorithm to the discrete problem, Levy flight step size should be discretization. In this paper, the Levy flight discretization includes the mirror reflection method to limit the search area and area blocking method so as to find the nearest discrete point quickly. Two matrices are introduced to record the point numbers and the point IDs in every block. Finally, the LEACH-C protocol is improved by the discretization cuckoo search algorithm. The simulation result shows the convergence is faster, the cluster head distributions are more uniform, and the network energy consumption is lower.