Multi-hop leach using the great deluge optimization in wireless sensor optimization

Abstract

The Wireless Sensor Networks (WSNs) today is gaining plenty of attention due to its wide application range. The reduction of consumption of energy of their sensor nodes has been considered to be a crucial challenge for operating the WSNs in the long run. Low-Energy Adaptive Clustering Hierarchy (LEACH) which is an extremely popular technique which can form several clusters by means of employing a distributed algorithm. The Multi-Hop Low Energy Adaptive Clustering Hierarchy (MH-LEACH) has minimized the consumption of energy at the time of transmission of data among the Cluster Heads (CH) and Base Station (BS). The load is further reduced by multi-hop routing wherein packets are duplicated within the network to improve the efficiency of energy for the WSN. A heuristic method of local search is the Great Deluge Algorithm (GDA) which is employed for solving problems in optimization. In this work, a multi-hop LEACH along with the Great Deluge Algorithm that has been proposed for efficiency in clustering of the WSN.