Energy-aware data gathering in wireless sensor networks

Authors:
Soyoung Hwang;Gwang-Ja Jin;Changsub Shin;Bongsoo Kim
Affiliations:
Electronics and Telecommunications Research Institute, Daejeon, Korea;Electronics and Telecommunications Research Institute, Daejeon, Korea;Electronics and Telecommunications Research Institute, Daejeon, Korea;Electronics and Telecommunications Research Institute, Daejeon, Korea
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 5
Cited 1

Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Optimal Physical Diversity Algorithms and Survivable Networks

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Reliable Energy Aware Routing In Wireless Sensor Networks

DSSNS '06 Proceedings of the Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems
Routing techniques in wireless sensor networks: a survey

IEEE Wireless Communications

EDR: efficient data routing in wireless sensor networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an energy-aware data gathering method called Energy-aware Tree Routing (ETR) in Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23%∼55% in network lifetime.