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.
This work is supported by National Natural Science foundation of China under grants No.60434030 and No.60373049.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. IEEE International Conference on System Sciences, Maui, Hawaii (January 4-7, 2000)
Chang, J.-H., Tassiulas, L.: Maximum Lifetime Routing in Wireless Sensor Networks. In: Proc. Advanced Telecommunications and Information Distribution Research Program (ATIRP 2000), College Park, MD (March 2000)
Chang, J.-H., Tassiulas, L.: Energy Conserving Routing in Wireless Ad-hoc Networks. In: Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, pp. 22–31 (March 2000)
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J.S., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking 11(1), 2–16 (2003)
Shah, R.C., Rabaey, J.: Energy Aware Routing for Low Energy Ad Hoc Sensor Networks. In: IEEE Wireless Communications and Networking Conference (WCNC), Orlando, FL, March 17-21 (2002)
Braginsky, D., Estrin, D.: Rumor Routing Algorithm For Sensor Networks. In: The First Workshop on Sensor Networks and Applications (WSNA 2002), Atlanta, GA (October 2002)
Karp, B., Kung, H.T.: GPSR: Greedy Perimeter stateless Routing for Wireless Networks. In: MobiCom 2000, Boston, Massachusetts, August 6-11 (2000)
Yu, Y., Govindan, R., Estrin, D.: Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks. UCLA Computer Science Department Technical Report UCLA/CSD-TR-01-0023 (May 2001)
Xu, Y., Heidemann, J.S., Estrin, D.: Geography-informed energy conservation for Ad Hoc routing. In: MOBICOM 2001, pp. 70–84 (2001)
Newsome, J., Song, D.: GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic Information. In: The First ACM Conference on Embedded Networked Sensor Systems (Sensys 2003), Los Angeles, CA, USA (November 2003)
Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic Routing without Location Information. In: MobiCom 2003, San Diego, California, USA, September 14-19 (2003)
Shenker, S., Ratnasamy, S., Karp, B., Govindan, R., Estrin, D.: Datacentric storage in sensornets. Computer Communication Review 33(1), 137–142 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, LM., Yan, TX., Bi, YZ., Zhu, HS. (2005). A Self-adaptive Energy-Aware Data Gathering Mechanism for Wireless Sensor Networks. In: Huang, DS., Zhang, XP., Huang, GB. (eds) Advances in Intelligent Computing. ICIC 2005. Lecture Notes in Computer Science, vol 3645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538356_61
Download citation
DOI: https://doi.org/10.1007/11538356_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28227-3
Online ISBN: 978-3-540-31907-8
eBook Packages: Computer ScienceComputer Science (R0)