Skip to main content

A Fast Traffic Planning Algorithm in Lifetime Optimization of Sensor Networks

  • Conference paper
Book cover Ubiquitous Intelligence and Computing (UIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4159))

Included in the following conference series:

  • 884 Accesses

Abstract

The lifetime optimization is a key challenge of sensor networks. Since data transmission is the main energy consumer, it is important to make use of energy efficient communication protocols to prolong the network lifetime. We formalize the lifetime optimization problem to a max flow problem in a directed graph with capacity powers on arcs and vertices. Then we propose a fast algorithm to solve this problem. The method gives the value of maximum lifetime exactly. The time complexity is O(|V|2.|A|)

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhardwaj, M., Chandrakasan, A., Garnett, T.: Upper Bounds on the Lifetime of Sensor Networks. In: IEEE International Conference on Communications, Helsinki, Finland (June 2001)

    Google Scholar 

  2. Bhardwaj, M., Chandrakasan, A.: Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments. In: IEEE INFOCOM 2002 (2002)

    Google Scholar 

  3. Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: IEEE INFOCOM 2000 (2000)

    Google Scholar 

  4. Dasgupta, K., Kalpakis, K., Namjoshi, P.: Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks. Computer Networks 42 (2003)

    Google Scholar 

  5. Sankar, Z.L.: Maximum Lifetime Routing in Wireless Ad-hoc Networks. In: INFOCOM 2004 (2004)

    Google Scholar 

  6. Madan, R., Lall, S.: Distributed Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks. In: Global Telecommunications Conference, vol. 2, IEEE, Los Alamitos (2004)

    Google Scholar 

  7. Malhotra, V.M., Pramodh Kumar, M., Maheshwari, S.N.: An O(|V|3) algorithm for finding maximum flows in networks. Information Processing Letters 7, 277–278 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pan, Y., Peng, W., Lu, X., Ma, S., Zhu, P. (2006). A Fast Traffic Planning Algorithm in Lifetime Optimization of Sensor Networks. In: Ma, J., Jin, H., Yang, L.T., Tsai, J.JP. (eds) Ubiquitous Intelligence and Computing. UIC 2006. Lecture Notes in Computer Science, vol 4159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11833529_47

Download citation

  • DOI: https://doi.org/10.1007/11833529_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38091-7

  • Online ISBN: 978-3-540-38092-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics