Skip to main content

Lifetime Maximization of Monitoring Sensor Networks

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 6451)

Abstract

We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbitrarily close to the optimal solution, if we additionally allow the sensing ranges to increase by a small factor. The best previous result is superlinear and has a logarithmic approximation ratio. We also provide the first proof of NP-completeness of this specific problem.

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: Proceedings of the Wireless Communications and Networking Conference 2004, vol. 4, pp. 2329–2334. IEEE Computer Society Press, Los Alamitos (March 2004)

    Google Scholar 

  2. Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient energy management in sensor networks. In: Pan, Y., Xiao, Y. (eds.) Ad Hoc and Sensor Networks. Wireless Networks and Mobile Computing, vol. 2, pp. 71–90. Nova Science Publisher, Bombay (2005)

    Google Scholar 

  3. Cardei, M., Wu, W.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Computer Communications 29(4), 413–420 (2006)

    Article  Google Scholar 

  4. Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: Proceedings of the IEEE International Conference on Communications 2001, pp. 472–476 (June 2001)

    Google Scholar 

  5. Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-Efficient Target Coverage in Wireless Sensor Networks. In: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom), vol. 4, pp. 1976–1984. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  6. Garg, N., Könemann, J.: Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 300–309. IEEE Computer Society, Los Alamitos (1998)

    Google Scholar 

  7. Dhawan, A., Vu, C.T., Zelikovsky, A., Li, Y., Prasad, S.K.: Maximum Lifetime of Sensor Networks with Adjustable Sensing Range. In: Proceedings of the International Workshop on Self-Assembling Wireless Networks. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  8. Gu, Y., Liu, H., Zhao, B.: Joint Scheduling and Routing for Lifetime Elongation in Surveillance Sensor Networks. In: Proceedings of the 2nd IEEE Asia-Pacific Service Computing Conference (APSCC), pp. 304–311 (2007)

    Google Scholar 

  9. Luo, J., Girard, A., Rosenberg, C.: Efficient Algorithms to Solve a Class of Resource Allocation Problems in Large Wireless Networks. In: 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt (June 2009)

    Google Scholar 

  10. Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 32(1), 130–136 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Williams, R.: The Geometrical Foundation of Natural Structure: A Source Book of Design. The Dover Publications, New York (June 1979)

    Google Scholar 

  12. Masuyama, S., Ibaraki, T., Hasegawa, T.: The Computational Complexity of the m-Center Problems on the Plane. IEICE Transactions Japan E64(2), 57–64 (1981)

    Google Scholar 

  13. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sanders, P., Schieferdecker, D. (2010). Lifetime Maximization of Monitoring Sensor Networks. In: Scheideler, C. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2010. Lecture Notes in Computer Science, vol 6451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16988-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16988-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16987-8

  • Online ISBN: 978-3-642-16988-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics