Abstract
Wireless sensor networks are envisioned to be promising in gathering useful information from areas of interest. Due to the limited battery power of sensors, one critical issue in designing a wireless sensor network is to maximize its lifetime. Many efforts have been made to deal with this problem. However, most existing algorithms are not well optimized. In this paper, we investigate the maximum lifetime data gathering problem formally. We adopt tree structure as the basic routing scheme for our analysis, and propose a near optimal maximum lifetime data gathering and aggregation algorithm MLDGA. MLDGA tries to minimize the total energy consumption in each round as well as maximize the lifetime of a routing tree used in the round. Comparing with existing algorithms which are only efficient in some specified conditions, the simulation results show that our algorithm performs well regardless of the base station location and the initial battery energy levels of sensors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4) (2002)
Considine, J., Li, F., Kollios, G., Byers, J.: Approximate aggregation techniques for sensor databases. In: Proceedings of International Conference on Data Engineering (ICDE) (March 2004)
Chang, J.H., Tassiulas, L.: Energy Conserving Routing in Wireless Ad-hoc Networks. In: Proceedings of IEEE INFOCOM (March 2000)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: Proceedings of 33rd Annual Hawaii International Conference on System Sciences (2000)
Kang, I., Poovendran, R.: Maximizing Network Lifetime of Broadcast over Wireless Stationary Ad Hoc Networks. In: ACM/Kluwer MONET Special Issue on Energy Constraints and Lifetime Performance in Wireless Sensor Networks (2004)
Krishnamachari, B., Estrin, D., Wicker, S.: Modelling Data-Centric Routing in Wireless Sensor Networks. In: Proceedings of IEEE INFOCOM (2002)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next Century Challenges: Mobile Networking for Smart Dust. In: Proceedings of 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 1999) (August 1999)
Lindsey, S., Raghavendra, C.S.: Pegasis: Power-Efficient Gathering in Sensor Information Systems. In: IEEE Aerospace Conference (March 2002)
Tan, H.O., Korpeoglu, I.: Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks. SIGMOD Record 32(4) (December 2003)
Tubaishat, M., Madria, S.: Sensor Networks: An Overview. IEEE Potentials 22 (April 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
Zhang, Q., Xie, Z., Sun, W., Shi, B. (2005). Tree Structure Based Data Gathering for Maximum Lifetime in Wireless Sensor Networks. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds) Web Technologies Research and Development - APWeb 2005. APWeb 2005. Lecture Notes in Computer Science, vol 3399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31849-1_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-31849-1_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25207-8
Online ISBN: 978-3-540-31849-1
eBook Packages: Computer ScienceComputer Science (R0)