An Approach To Optimize H-Leach For Efficient Clustering In WSN

Wireless sensor network (WSN) is a type of network which consist of many number of sensor nodes that are deployed in some specific areas for performing certain tasks. These nodes transmit the data to its nearest base station (BS). The nodes having limited amount of energy can be utilized for transmitting data. The huge amount of energy consumed for sending the low volume of data is a major problem in WSN. In this article, an algorithm has been proposed for reducing the consumption of energy in sending data by dividing whole area into small subareas. H-LEACH is an algorithm that uses remaining energy and maximum energy of a node to choose cluster head (CH) for efficient utilization of the sensor nodes in the formation of cluster. In LEACH, CH is selected randomly on the basis of probabilistic approach where each capable nodes get opportunity to become CH. However in LEACH, much attention has not been given to regional division as well as distance factor. While in our proposed algorithm, we have taken care of all considered regional division and also relative distance of each qualifying nodes to the BS. The proposed algorithm improves the life time of a node by extending it up to 5% as compared to H-LEACH algorithm [10] and 10% as compared to LEACH algorithm [8].