REACH: The new routing algorithm based on energy aware clustering hierarchical for lifetime increasing in wireless sensor networks

In wireless sensor networks there are many limitations that among which can be pointed to the power constrain so that can be considered this constraint as the most important restriction. Hence in the recent researches, scientific communities have been considered this problem as main challenge. That´s why many protocols have been suggested in different fields of wireless sensor network for decreasing and balancing the energy consumption. Of these protocols can be pointed to the routing based on clustering algorithms such as LEACH and HEED. In this paper we propose the hierarchical routing algorithm based on new cluster head selection and cluster formation protocol namely REACH. This algorithm selects a best sensor node as a cluster head in terms of energy and distance. Simulation Results show that the REACH prolongs the network lifetime about 40% and 13% compared to the LEACH and HEED, respectively.