A self-adaptive energy-aware data gathering mechanism for wireless sensor networks

Authors:
Li-Min Sun;Ting-Xin Yan;Yan-Zhong Bi;Hong-Song Zhu
Affiliations:
Institute of Software, Chinese Academy of Science, Beijing, P.R.China;Institute of Software, Chinese Academy of Science, Beijing, P.R.China;Institute of Software, Chinese Academy of Science, Beijing, P.R.China;Institute of Software, Chinese Academy of Science, Beijing, P.R.China
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Year:
2005

Citing 8
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Rumor routing algorthim for sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Directed diffusion for wireless sensor networking

IEEE/ACM Transactions on Networking (TON)
Data-centric storage in sensornets

ACM SIGCOMM Computer Communication Review
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information

Proceedings of the 1st international conference on Embedded networked sensor systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sensor networks are composed of a large number of densely deployed sensors. The sensor nodes are self-organized and form an ad hoc network. As the energy supply to sensor nodes is limited and cannot be replenished, energy efficiency is an important design consideration for sensor networks. We design and evaluate an energy efficient routing algorithm for data querying sensor networks that propagates routing instructions and build data paths by considering both the hop count to the sink node and the minimum residual energy of that path. The proposed Dynamic Energy Aware Routing (DEAR) algorithm can effectively choose a data path with low energy consumption and high residual energy. The simulation results show that DEAR can prolong the lifetime of networks compared with Directed Diffusion, Minimum Transmission Energy routing and Energy Aware Routing.