LEACH-HPR: An energy efficient routing algorithm for Heterogeneous WSN

• Published in: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems Vol. 2; pp. 507 - 511
• Main Author: Li Han
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2010
• Subjects: assistant-CH node; Energy Efficient; Heterogeneous; Nominations and elections; Nonhomogeneous media; Peer to peer computing; Routing; Wireless Sensor Network; Wireless sensor networks
• ISBN: 9781424465828; 1424465826
• DOI: 10.1109/ICICISYS.2010.5658274

In wireless sensor network, there are many hurdles takes place in providing quality of service routing to a desired level. The majority of routing protocols in wireless sensor networks concentrates on energy efficiency as a prime factor. Developing an energy-efficient routing protocol has a significant impact on the overall lifetime and stability of the sensor network. In this paper, we have considered three types of sensor nodes. Some fraction of the sensor nodes are equipped with the additional energy resources than the other nodes. We have assumed that all the sensor nodes are uniformly distributed. In the Heterogeneous WSN, we proposed an energy efficient cluster head election protocol (LEACH-HPR) and using the minimum spanning tree algorithm to construct an inter-cluster routing. Simulation results show out method is more efficient to reduce and balance energy consumption and hence prolong the lifetime of WSN.