Skip to main content

Advertisement

SpringerLink
Log in

Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

An Erratum to this article was published on 16 June 2006

Abstract

This paper studies energy efficient routing for data aggregation in wireless sensor networks. Our goal is to maximize the lifetime of the network, given the energy constraint on each sensor node. Using linear programming (LP) formulation, we model this problem as a multicommodity flow problem, where a commodity represents the data generated from a sensor node and delivered to a base station. A fast approximate algorithm is presented, which is able to compute (1−ε)-approximation to the optimal lifetime for any ε > 0. Then along this baseline, we further study several advanced topics. First, we design an algorithm, which utilizes the unique characteristic of data aggregation, and is proved to reduce the running time of the fastest existing algorithm by a factor of K, K being the number of commodities. Second, we extend our algorithm to accommodate the same problem in the setting of multiple base stations, and study its impact on network lifetime improvement. All algorithms are evaluated through both solid theoretical analysis and extensive simulation results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cyirci, Wireless sensor networks: A survey, Computer Networks 38(4), (2002) 393–422.

    Article  Google Scholar 

  2. B. Awerbuch and T. Leighton, A simple local-control approximation algorithm for multicommodity flow, in: Proc. of 3rd IEEE Symposium on Found. of Comp. Science (1993) pp. 459–468.

  3. B. Awerbuch and T. Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in: Proc. of the 26th Annual ACM Symposium on Theory of Computing (1994) pp. 487–496.

  4. M. Bhardwaj and A.P. Chandrakasan, Bounding the lifetime of sensor networks via optimal role assignments, in: Proc. of INFOCOM (2002) pp. 1587–1596.

  5. J. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: Proc. of INFOCOM (2000) pp. 22–31.

  6. J. Chang and L. Tassiulas, Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks, in: Proc. of NETWORKING (2000) pp. 702–713.

  7. X. Cheng, B. Narahari, R. Simha, M.X. Cheng and D. Liu, Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics, IEEE Tran. on Mobile Computing 2(3) (2003).

  8. K. Dasgupta, K. Kalpakis and P. Namjoshi, Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks, Computer Networks 42 (2003) 697–716.

    Article  Google Scholar 

  9. K. Dasgupta, M. Kukreja and K. Kalpakis, Topology-aware placement and role assignment for energy-efficient information gathering in sensor networks, in: Proc. of the 8th IEEE Symposium on Computers and Communications (2003).

  10. L.K. Fleischer, Approximating fractional multicommodity flow independent of the number of commodities, SIAM Journal of Discrete Mathematics 13 (2000) 505, 520.

    Article  MATH  MathSciNet  Google Scholar 

  11. S.R. Gandham, M. Dawande, R. Prakash and S. Venkatesan, Energy-efficient schemes for wireless sensor networks with multiple mobile base stations, in: Proc. of IEEE Globecom (2003).

  12. N. Garg and J. Konemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in: Proc. of IEEE Symposium on Found. of Comp. Science (1998) pp. 300–309.

  13. J. Gomez, A. Campbell, M. Naghshineh and C. Bisdikian, Conserving transmission power in wireless ad hoc networks, in: Proc. of 9th International Conference on Network Protocols (ICNP) (2001).

  14. M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimizations, Springer-Verlag (1993).

  15. Y.T. Hou, Y. Shi and H.D. Sherali, On lexicographic max-min node lifetime problem for energy-constrained wireless sensor networks, in: Technical Report, The Bradley Dept. of ECE, Virginia Tech (2003).

  16. Y.T. Hou, Y. Shi, and H.D. Sherali, On rate allocation problem for wireless sensor networks, in: Technical Report, The Bradley Dept. of ECE, Virginia Tech (2003).

  17. C. Intanagonwiwat, R. Govindan and D. Estrin, Directed diffusion: A scalable and robust communication paradigm for sensor networks, in: Proc. of MOBICOM (2000).

  18. K. Kar, M. Kodialam, T.V. Lakshman and L. Tassiulas, Routing for network capacity maximization in energy-constrained ad-hoc networks, in: Proc. of INFOCOM (2003).

  19. B. Krishanamachari, D. Estrin and S. Wicker, The impact of data aggregation in wireless sensor networks, in: Proc. of International Workshop of Distributed Event Based Systems (DEBS) (2002).

  20. Q. Li, J. Aslam and D. Rus, Online power-aware routing in wireless ad-hoc networks, in: Proc. of MOBICOM (2001) pp. 97–107.

  21. S. Lindsey, C.S. Raghavendra and K. Sivalingam, Data gathering algorithms in sensor networks using energy metrics, IEEE Trans. on Parallel and Distributed Systems (2002).

  22. V. Rodoplu and T. Meng, Minimum energy mobile wireless networks, IEEE Journal of Selected Areas in Communications 17(8) (1999) 1333–1344.

    Article  Google Scholar 

  23. A. Sankar and Z. Liu, Maximum lifetime routing in wireless ad-hoc networks, in: Proc. of INFOCOM (2004).

  24. S. Singh, M. Woo and C. Raghavendra, Power-aware routing in mobile ad-hoc networks, in: Proc. of MOBICOM (1998) pp. 181–190.

  25. V. Srinivasan, C.F. Chiasserini, P. Nuggehalli and R.R. Rao, Optimal rate allocation and traffic splits for energy efficient routing in ad hoc networks, in: Proc. of INFOCOM, 2002.

  26. I. Stojmenovic and X. Lin, Power-aware localized routing in wireless networks, IEEE Tran. on Parallel and Distributed Systems 12(11) (2001) 1122–1133.

    Google Scholar 

  27. R. Wattenhofer, L. Li, P. Bahl and Y. Wang, Distributed topology control for power efficient operation in multihop wireless ad hoc networks, in: Proc. of INFOCOM (2001).

  28. Y. Xue and B. Li, Location-aided power-aware routing for wireless ad-hoc networks, in: Proc. of Globecom (2001).

  29. G. Zussman and A. Segall, Energy efficient routing in ad hoc disaster recovery networks, in: Proc. of INFOCOM (2003).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Vanderbilt University, VU Station B 351824, Nashville, TN, 37235, USA

    Yuan Xue, Yi Cui & Klara Nahrstedt

Authors
  1. Yuan Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Klara Nahrstedt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan Xue.

Additional information

Yuan Xue received her B.S. in Computer Science from Harbin Institute of Technology, China in 1994 and her M.S. and Ph.D. in Computer Science from the University of Illinois at Urbana-Champaign in 2002, and 2005. Currently she is an assistant professor at the Department of Electrical Engineering and Computer Science of Vanderbilt University. Her research interests include wireless and sensor networks, mobile systems, and network security.

Yi Cui received his B.S. and M.S. degrees in 1997 and 1999, from Department of Computer Science, Tsinghua University, China, and his Ph.D. degree in 2005 from the Department of Computer Science, University of Illinois at Urbana-Champaign. Since then, he has been with the Department of Electrical Engineering and Computer Science at Vanderbilt University, where he is currently an assistant professor. His research interests include overlay network, peer-to-peer system, multimedia system, and wireless sensor network.

Klara Nahrstedt (M ' 94) received her A.B., M.Sc degrees in mathematics from the Humboldt University, Berlin, Germany, and Ph.D in computer science from the University of Pennsylvania. She is an associate professor at the University of Illinois at Urbana-Champaign, Computer Science Department where she does research on Quality of Service(QoS)-aware systems with emphasis on end-to-end resource management, routing and middleware issues for distributed multimedia systems. She is the coauthor of the widely used multimedia book ‘Multimedia:Computing, Communications and Applications’ published by Prentice Hall, and the recipient of the Early NSF Career Award, the Junior Xerox Award and the IEEE Communication Society Leonard Abraham Award for Research Achievements, and the Ralph and Catherine Fisher Professorship Chair. Since June 2001 she serves as the editor-in-chief of the ACM/Springer Multimedia System Journal.

An erratum to this article is available at http://dx.doi.org/10.1007/s11036-006-9080-2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xue, Y., Cui, Y. & Nahrstedt, K. Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks. Mobile Netw Appl 10, 853–864 (2005). https://doi.org/10.1007/s11036-005-4443-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-005-4443-7

Keywords

Search

Navigation