RECH-LEACH: A New Cluster Head Selection Algorithm of LEACH on the Basis of Residual Energy for Wireless Sensor Network

Abstract

Wireless sensor network is constructed of small low power sensor devices. These sensor devices contain small battery capacity and placed in hostile condition. When these sensor nodes are positioned in an area, it is almost impossible to make an alteration of the battery of these devices if they run out of power. If a sensor device dies due to low power, it becomes quite illusive to monitor the condition of that area. Therefore, controlling the energy depletion of the network is a vital task. LEACH protocol is such kind of energy competent protocol which reduces energy dissipation of the network and enhances its lifespan. But it has a few constraints too. The cluster head (CH) election procedure of LEACH is not quite competent. It selects cluster heads randomly without judging the energy or distance of the nodes from the base station. So, to resolve these issues we come up with new CH election algorithm. We named RECH-LEACH (Residual Energy-based Cluster Head selection). RECH-LEACH works almost same as LEACH except the selection procedure of CH after the first round. In RECH-LEACH, CHs are chosen on the basis of remaining energy of the sensor devices. The nodes with the highest energy after each round will become CH based on the probability of being CH. The aim of the RECH-LEACH algorithm is to shrink the energy dissipation of sensor nodes and elongate the lifespan of the network. We run the simulation in MATLAB and after the simulation the result shows that RECH-LEACH surpasses LEACH protocol with a huge margin and attains its goal.