Skip to main content

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 569 Accesses

Abstract

In this chapter, we study trap coverage in sensor networks, which is recognized to be efficient for intruder detection. We formally formulate the Minimum Weight Trap Cover Problem and prove it is an NP-hard problem. To solve the problem, we introduce a bounded approximation algorithm, called Trap Cover Optimization (TCO) to schedule the activation of sensors while satisfying specified trap coverage requirement. We design Localized Trap Coverage Protocol as the localized implementation of TCO. We show that the performance of Minimum Weight Trap Coverage is at most O(ρ) times of the optimal solution, where ρ is the density of sensor nodes in the region. We perform extensive simulations to demonstrate the effectiveness of the 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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. J. Ko, C. Lu, M. Srivastava, J. Stankovic, A. Terzis, and M. Welsh. Wireless sensor networks for healthcare. Proceedings of the IEEE, 98(11):1947–1960, 2010.

    Article  Google Scholar 

  2. X. Cao, J. Chen, Y. Zhang, and Y. Sun. Development of an integrated wireless sensor network micro-environment monitoring system. ISA Transactions (Elsevier), 47(3):247–255, 2008.

    Google Scholar 

  3. S. Zahedi, M. Srivastava, C. Bisdikian, and L. Kaplan. Quality tradeoffs in object tracking with duty-cycled sensor networks. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2010.

    Google Scholar 

  4. Y. Liu and W. Liang. Approximate coverage in wireless sensor networks. In IEEE International Conference on Local Computer Networks (LCN), 2005.

    Google Scholar 

  5. M. Cardei, T. Thai, Y. Li, and W. Wu. Energy-efficient target coverage in wireless sensor networks. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), 2005.

    Google Scholar 

  6. S. He, J. Chen, and Y. Sun. Coverage and connectivity in duty-cycled wireless sensor network for event monitoring. IEEE Transactions on Parallel and Distributed Systems, 23(3):475–482, 2012.

    Article  Google Scholar 

  7. S. Slijepcevic and M. Potkonjak. Power efficient organization of wireless sensor networks. In IEEE International Conference on Communications (ICC), pages 472–476, 2001.

    Google Scholar 

  8. J. Chen, J. Li, S. He, Y. Sun, and H. Chen. Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks. IEEE Communication Letters, 14(9):833–835, 2010.

    Article  Google Scholar 

  9. J. Jeong, Y. Gu, T. He, and D. Du. Visa: Virtual scanning algorithm for dynamic protection of road networks. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), 2009.

    Google Scholar 

  10. G. Wang, G. Cao, and T. Porta. Movement-assisted sensor deployment. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), 2004.

    Google Scholar 

  11. B. Liu and D. Towsley. A study of the coverage of large-scale sensor networks. In IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004.

    Google Scholar 

  12. P. Balister, Z. Zheng, S. Kumar, and P. Sinha. Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), 2009.

    Google Scholar 

  13. J. Li, J. Chen, S. He, T. He, Y. Gu, and Y. Sun. On energy-efficient trap coverage in wireless sensor networks. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2011.

    Google Scholar 

  14. G. Mao, B. Fidan, and B. Anderson. Wireless sensor network localization techniques. Computer Networks, 51(10):2529–2553, 2007.

    Article  MATH  Google Scholar 

  15. N. Patwari, J. Ash, S. Kyperountas, A. Hero, R. Moses, and N. Correal. Locating the nodes: cooperative localization in wireless sensor networks. IEEE Signal Processing Magazine, 22(4):54–69, 2005.

    Article  Google Scholar 

  16. J. Hwang, T. He, and Y. Kim. Exploring in-situ sensing irregularity in wireless sensor networks. In Proceedings of the International Conference on Embedded Networked Sensor Systems (SenSys), 2007.

    Google Scholar 

  17. T. Yan, Y. Gu, T. He, and J. Stankovic. Design and optimization of distributed sensing coverage in wireless sensor networks. ACM Transactions on Embedded Computing Systems, 7(3):1–40, 2008.

    Article  Google Scholar 

  18. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration in wireless sensor networks. In Proceedings of the International Conference on Embedded Networked Sensor Systems (SenSys), 2003.

    Google Scholar 

  19. G. Kasbekar, Y. Bejerano, and S. Sarkar. Lifetime and coverage guarantees through distributed coordinate-free sensor activation. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom), 2009.

    Google Scholar 

  20. S. Yang, F. Dai, M. Cardei, and J. Wu. On multiple point coverage in wireless sensor networks. In Proceedings of IEEE Conference on Mobile Adhoc and Sensor Systems Conference (MASS), 2005.

    Google Scholar 

  21. R. M. Karp. Reducibility among combinatorial problems. In 50 Years of Integer Programming 1958–2008, pages 219–241. Springer Berlin Heidelberg, 2010.

    Google Scholar 

  22. P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky. Efficient energy management in sensor networks. In Ad Hoc and Sensor Network. Nova Science Publishers, 2005.

    Google Scholar 

  23. M. Cardei and D. Du. Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 11(3):333–340, 2005.

    Article  Google Scholar 

  24. X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. Lai. Deploying wireless sensors to achieve both coverage and connectivity. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2006.

    Google Scholar 

  25. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233–235, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  26. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Data structures for disjoint sets. In Introduction to Algorithms, pages 498–524. MIT Press and McGraw-Hill, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 The Author(s)

About this chapter

Cite this chapter

He, S., Chen, J., Li, J., Sun, Y. (2014). Energy-Efficient Trap Coverage in Sensor Networks. In: Energy-Efficient Area Coverage for Intruder Detection in Sensor Networks. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-04648-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04648-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04647-1

  • Online ISBN: 978-3-319-04648-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics