An effective hyper-heuristic algorithm for clustering problem of wireless sensor network

Abstract

The basic idea of low-energy adaptive clustering hierarchy (LEACH) is not to select a particular set of sensors out of all the sensors as the cluster heads to avoid the problem of running out their energy quickly. Unfortunately, it may end up selecting an unsuitable set of sensors as the cluster heads. Inspired by these observations, an effective hyper-heuristic algorithm is presented in this paper to find out the transmission path that is able to give better results than the other algorithms compared in this research. In other words, the main objective of the proposed algorithm is to reduce the energy consumption of a wireless sensor network (WSN), by balancing the residual energy of all the wireless sensors to maximize the number of alive sensor nodes in a WSN. Experimental results show that the proposed algorithm can provide a better result in terms of the energy consumed by a WSN, meaning that the proposed algorithm provides an alternative way to extend the lifetime of a WSN.