Skip to main content

Sensor Scheduling for k-Coverage in Wireless Sensor Networks

  • Conference paper
Book cover Mobile Ad-hoc and Sensor Networks (MSN 2006)

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

Included in the following conference series:

Abstract

Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this paper, we investigate the Sensor Scheduling for k-Coverage (SSC) problem which requires to efficiently schedule the sensors, such that the monitored region can be k-covered throughout the whole network lifetime with the purpose of maximizing network lifetime. The SSC problem is NP-hard and we propose a heuristic algorithm for it. In addition, we develop a guideline for users to better design a sensor deployment plan to save energy by employing density control. Simulation results are presented to evaluate our proposed algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. Raghunathan, V., Schurgers, C., Park, S., Srivastava, M.B.: Energy-aware wireless microsensor networks. IEEE Signal Processing Magazine 19, 40–50 (2002)

    Article  Google Scholar 

  3. Benini, L., Castelli, G., Macii, A., Macii, E., Poncino, M., Scarsi, R.: A Discrete-Time Battery Model for High-Level Power Estimation. In: Proceedings of DATE, pp. 35–39 (2000)

    Google Scholar 

  4. Huang, C., Tseng, Y.: The coverage problem in a wireless sensor network. In: WSNA 2003, San Diego, CA (September 2003)

    Google Scholar 

  5. Zhou, Z., Das, S., Gupta, H.: Connected k-coverage problem in sensor networks. In: Proceedings of the International Conference on Computer Communications and Networks (2004)

    Google Scholar 

  6. Cardei, M., Wu, J.: Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks. Journal of Computer Communications on Sensor Networks (2004)

    Google Scholar 

  7. Cardei, M., Thai, M., Li, Y., Wu, W.: Energy-Efficient Target Coverage in Wireless Sensor Networks. In: IEEE INFOCOM 2005, Miami, FL (March 2005)

    Google Scholar 

  8. Cardei, M., Du, D.-Z.: Improving Wireless Sensor Network Lifetime through Power Aware Organization. ACM Wireless Networks 11(3), 333–340 (2005)

    Article  Google Scholar 

  9. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: SenSys 2003, Los Angeles, CA (November 2003)

    Google Scholar 

  10. Gupta, H., Das, S., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: MobiHoc 2003, Annapolis, MA (June 2003)

    Google Scholar 

  11. Abrams, Z., Goel, A., Plotkin, S.: Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. In: Proc. of Third International Symposium on Information (2004)

    Google Scholar 

  12. Cheng, M.X., Ruan, L., Wu, W.: Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks. In: IEEE INFOCOM 2005, Miami, FL (March 2005)

    Google Scholar 

  13. Kumar, S., Lai, T.H., Balogh, J.: On k-Coverage in a Mostly Sleeping Sensor Network. In: Proc of the 10th international Conference on Mobile computing and networking, Philadelphia, PA, USA, pp. 144–158 (2004)

    Google Scholar 

  14. Huang, Q.: Solving an open sensor exposure problem using variational calculus. Technical Report WUCS-03-1, Washington University, Department of Computer Science and Engineering, St. Louis, Missouri (2003)

    Google Scholar 

  15. Li, X., Wan, P., Frieder, O.: Coverage in wireless ad hoc sensor networks. IEEE Trans. Comput. 52(6), 753–763 (2003)

    Article  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

Gao, S., Vu, C.T., Li, Y. (2006). Sensor Scheduling for k-Coverage in Wireless Sensor Networks. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_23

Download citation

  • DOI: https://doi.org/10.1007/11943952_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49932-9

  • Online ISBN: 978-3-540-49933-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics