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

Author

Li Han

Author_Institution

Sch. of Sci., Beijing Inf. Sci. & Technol. Univ., Beijing, China

Volume

2

fYear

2010

fDate

29-31 Oct. 2010

Firstpage

507

Lastpage

511

Abstract

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.

Keywords

energy consumption; routing protocols; trees (mathematics); wireless sensor networks; LEACH-HPR routing algorithm; cluster head election protocol; energy consumption; energy-efficient routing protocol; heterogeneous wireless sensor network; intercluster routing; minimum spanning tree algorithm; Nominations and elections; Nonhomogeneous media; Peer to peer computing; Wireless sensor networks; Energy Efficient; Heterogeneous; Routing; Wireless Sensor Network; assistant-CH node;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on

Conference_Location

Xiamen

Print_ISBN

978-1-4244-6582-8

Type

conf

DOI

10.1109/ICICISYS.2010.5658274

Filename

5658274