Efficient Clustering Using Memetic Adaptive Hill Climbing Algorithm in WSN

Abstract

Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network. This closed network is intended to share sensitive location-centric information from a source node to the base station through efficient routing mechanisms. The efficiency of the sensor node is energy bounded, acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors. Network management plays a significant role in wireless sensor networks, which was obsessed with the factors like the reliability of the network, resource management, energy-efficient routing, and scalability of services. The topology of the wireless sensor networks acts driven factor for network efficiency which can be effectively maintained by performing the clustering process effectively. More solutions and clustering algorithms have been offered by various researchers, but the concern of reduced efficiency in the routing process and network management still exists. This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efficient clustering process in the wireless sensor networks. The memetic algorithm employs a local searching methodology to mitigate the premature convergence, while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain (i.e.,) best cluster head in the wireless sensor networks. The proposed hybrid algorithm is compared with the state of art clustering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time, energy consumption, throughput, etc.