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.
[1]
Dali Wei,et al.
Energy Efficient Clustering Algorithms for Wireless Sensor Networks
,
2008,
ICC Workshops - 2008 IEEE International Conference on Communications Workshops.
[2]
Anantha P. Chandrakasan,et al.
An application-specific protocol architecture for wireless microsensor networks
,
2002,
IEEE Trans. Wirel. Commun..
[3]
Dilip Kumar,et al.
EECHE: energy-efficient cluster head election protocol for heterogeneous wireless sensor networks
,
2009,
ICAC3 '09.
[4]
Azer Bestavros,et al.
SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks
,
2004
.
[5]
Sung-Min Jung,et al.
Architecture of Context-Aware Integrated Security Management Systems for Smart Home Environment
,
2007,
APNOMS.