Abstract
Reducing the network energy consumption and increasing the lifetime of network are important content for wireless sensor network. LEACH is an adaptive routing algorithm with low consumption for wireless sensor network. However there are many shortcomings in LEACH routing algorithm such as too much energy consumption of cluster heads and uneven clustering each round. This paper puts forward a new improved algorithm named H-LEACH to solve the problem above. It lets the nodes holding more energy have the high possibility to become cluster-heads through a threshold and constraints the number of clusters each round at the same time so that it can balance the energy distribution and reduce energy cost. Simulation results show that H-LEACH is more energy-efficient than LEACH protocol.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
