Skip to main content

K-Connected Target Coverage Problem in Wireless Sensor Networks

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4616))

Abstract

An important issue in deploying a WSN is to provide target coverage with high energy efficiency and fault-tolerance. Sensor nodes in a wireless sensor network are resource-constrained, especially in energy supply, and prone to failure. In this paper, we study the problem of constructing energy efficient and fault-tolerant target coverage. More specifically, we propose solutions to forming k-connected coverage of targets with the minimal number of active nodes. We first address the k-connected augmentation problem, and then show that the k-connected target coverage problem is NP-hard. We propose two heuristic algorithms to solve the problem. We have carried out extensive simulations to study the performance of the proposed algorithms. The evaluation results have demonstrated their desirable efficiency.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. Cardei, D., MacCallum, X., Cheng, M., Min, X., Jia, D.Y.: Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks 3, 213–229 (2002)

    Article  Google Scholar 

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

    Google Scholar 

  4. Li, X., Wan, P., Wang, Y., Frieder, O.: Coverage in Wireless Ad-hoc Sensor Networks. IEEE Transactions on Computers 52, 753–763 (2003)

    Article  Google Scholar 

  5. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad-hoc Sensor Networks. In: Proc. of INFOCOM 2001, pp. 1380–1387 (2001)

    Google Scholar 

  6. Kar, K., Banerjee, S.: Node Placement for Connected Coverage in Sensor Networks. In: Proc. of WiOpt 2003: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (2003)

    Google Scholar 

  7. Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Sensor Networks. In: Proc. of IEEE Int. Conference on Communications, vol. 2, pp. 472–476 (2001)

    Google Scholar 

  8. Huang, C., Tseng, Y.: The Coverage Problem in a Wireless Sensor Network. WSNA 2003, San Diego, California, USA (September 19, 2003)

    Google Scholar 

  9. Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. NSF International workshop on Theoretical and algorithmic Aspects of sensor, Ad Hoc Wireless and Peer-to-Peer Networks (2004)

    Google Scholar 

  10. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.D.: Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. The First ACM Conference on Embedded Networked Sensor Systems. ACM Press, New York (2003)

    Google Scholar 

  11. Wu, J., Yang, S.: Energy-Efficient Node Scheduling Models in Sensor Networks with Adjustable Ranges. Intel Journal of Foundations of Computer Science (2005)

    Google Scholar 

  12. Zhou, Z., Das, S., Gupta, H.: Connected K-Coverage Problem in Sensor Networks. In: ICCCN 2004, pp. 373–378 (2004)

    Google Scholar 

  13. Zhou, Z., Das, S., Gupta, H.: Fault Tolerant Connected Sensor Cover with Variable Sensing and Transmission Ranges. In: IEEE SECON 2005 (2005)

    Google Scholar 

  14. Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.S.: Fault-tolerant and 3-dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. In: Proc. of ICCCN 2002, pp. 392–397 (2002)

    Google Scholar 

  15. Li, N., Hou, J.C.: FLSS: A Fault-tolerant Topology Control Algoritjm for Wireless Networks. In: Proc. MobiCom, pp. 275–286 (2005)

    Google Scholar 

  16. Li, X.-Y., Wan, P.-J., Wang, Y., Yi, C.-W.: Fault Tolerant Deployment and Topology Control in Wireless Networks. In: Proc. of MobiHoc, pp. 117–128 (2003)

    Google Scholar 

  17. Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Inf. Comput. 150, 57–74 (1999)

    Article  MathSciNet  Google Scholar 

  18. Cardei, M., Thai, M., Li, Y.S., Wu, W.L.: Energy-Efficient Target Coverage in Wireless Sensor Networks. In: INFOCOM 2005

    Google Scholar 

  19. Jaggi, N., Abouzeid, A.A.: Energy-efficient Connected Coverage in Wireless Sensor Networks. In: AMOC, pp. 85–100 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas Dress Yinfeng Xu Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, D., Cao, J., Liu, M., Zheng, Y. (2007). K-Connected Target Coverage Problem in Wireless Sensor Networks. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73556-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics