Skip to main content

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 162))

  • 549 Accesses

Abstract

Consider a set \(\mathcal {S}\) of n homogeneous sensors and a set \(\mathcal {A}\) of m targets. A subset \(\mathcal {S}'\) of \(\mathcal {S}\) is called a sensor k-cover if every target in \(\mathcal {A}\) is covered by at least k sensors in \(\mathcal {S}'\). In this chapter, we study the following problem.

What would it be like to have not only color vision but culture vision, the ability to see the multiple worlds of others.

Mary Catherine Bateson

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 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Why this parameter is set to be 2k − 1? We will explain it later.

Bibliography

  1. Z. Abrams, A. Goel, S. Plotkin, Set K-cover algorithms for energy efficient monitoring in wireless sensor networks, in Proceedings of the Third International Symposium on Information (2004)

    Google Scholar 

  2. H.M. Ammari, On the problem of k-coverage in mission-oriented mobile wireless sensor networks. Comput. Netw. 56(7), 1935–1950 (2012)

    Article  Google Scholar 

  3. H.M. Ammari, Joint mobility and heterogeneity for connected k-coverage in sparsely deployed wireless sensor nets, in Wireless Algorithms, Systems, and Applications (2012), pp. 258–271

    Google Scholar 

  4. H.M. Ammari, Joint k-coverage and data gathering in sparsely deployed sensor networks - impact of purposeful mobility and heterogeneity. ACM Trans. Sens. Netw. 10(1), 8:1–8:33 (2013)

    Google Scholar 

  5. H.M. Ammari, A unified framework for k-coverage and data collection in heterogeneous wireless sensor networks. J. Parallel Distrib. Comput. 89, 37–49 (2016)

    Article  Google Scholar 

  6. H.M. Ammari, S.K. Das, Mission-oriented k-coverage in mobile wireless sensor networks, in International Conference on Distributed Computing and Networking (2010), pp. 92–103

    Google Scholar 

  7. H.M. Ammari, S.K. Das, Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Trans. Comput. 61(1), 118–133 (2012)

    Article  MathSciNet  Google Scholar 

  8. Y. Bejerano, Simple and efficient k-coverage verification without location information, in IEEE INFOCOM 2008 – The 27th Conference on Computer Communications (IEEE, Piscataway, 2008)

    Google Scholar 

  9. P. Berman, G. Calinescu, C. Shah, A. Zelikovsky, Power efficient monitoring management in sensor networks, in IEEE Wireless Communication and Networking Conference (WCNC’04), Atlanta (2004), pp. 2329–2334

    Google Scholar 

  10. P. Berman, G. Calinescu, C. Shah, A. Zelikovsky, Efficient energy management in sensor networks, in Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, vol. 2, ed. by Y. Xiao, Y. Pan (Nova Science Publishers, Hauppauge, 2005)

    Google Scholar 

  11. P.A. Birjandi, L. Kulik, E. Tanin, K-coverage in regular deterministic sensor deployments, in IEEE International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP) (2013), pp. 521–526

    Google Scholar 

  12. T. Erlebach, T. Grant, F. Kammer, Maximising lifetime for fault tolerant target coverage in sensor networks. Sustain. Comput. Inform. Syst. 1, 213–225 (2011)

    Google Scholar 

  13. S. Gao, C.T. Vu, Y. Li, Sensor scheduling for k-coverage in wireless sensor networks, in Mobile Ad-hoc and Sensor Networks (2006), pp. 268–280

    Google Scholar 

  14. S. Gao, C.T. Vu, Y. Li, Sensor scheduling for k-coverage in wireless sensor networks, in Mobile Ad-hoc and Sensor Networks (2006), pp. 268–280

    Google Scholar 

  15. K.-H. Juang, E.T. Wang, C.-F. Chiang, A.L.P. Chen, Verification of k-coverage on query line segments, in Proceedings of the 17th International Database Engineering & Applications Symposium (ACM, New York, 2013), pp. 114–121

    Google Scholar 

  16. S. Kumar, T. Lai, J. Balogh, On k-coverage in a mostly sleeping sensor network, in Proceedings of the ACM MobiCom (2004), pp. 144–158

    Google Scholar 

  17. Y. Li, S. Gao, Designing k-coverage schedules in wireless sensor networks. J. Comb. Optim. 15(2), 127–146 (2008)

    Article  MathSciNet  Google Scholar 

  18. L. Li, B. Zhang, J. Zheng, A study on one-dimensional k-coverage problem in wireless sensor networks. Wirel. Commun. Mob. Comput. 13(1), 1–11 (2013)

    Article  Google Scholar 

  19. J. Willson, Z. Zhang, W. Wu, D.-Z. Du, Fault-tolerant coverage with maximum lifetime in wireless sensor networks, in 2015 IEEE Conference on Computer Communications (INFOCOM) (2015), pp. 1364–1372

    Google Scholar 

  20. A. Yahyavi, L. Roostapoor, R. Aslanzadeh, M. Dehghan, N. Yazdani, Intrusion k-Coverage in wireless sensor networks, in Proceedings of the International Conference on Wireless Information Networks and Systems (2008), pp. 41–46

    Google Scholar 

  21. A. Yahyavi, L. Roostapoor, R. Aslanzadeh, N. Yazdani, DyKCo: dynamic k-coverage in wireless sensor networks, in 2008 IEEE International Conference on Systems, Man and Cybernetics (2008), pp. 2804–2809

    Google Scholar 

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

    Google Scholar 

  23. N. Yeasmin, k-Coverage problems and solutions in wireless sensor networks: a survey. Int. J. Comput. Appl. 100(17), 1–6 (2014)

    Google Scholar 

  24. L.-H. Yen, C.W. Yu, Y.-M. Cheng, Expected k-coverage in wireless sensor networks. Ad Hoc Netw. 4(5), 636–650 (2006)

    Article  Google Scholar 

  25. X. Zhang, C. Wang, Distributed k-coverage verification algorithm based on localized distance information in WSNs, in IEEE International Conference on Networking, Architecture, and Storage, 2009. NAS 2009 (IEEE, Piscataway, 2009), pp. 196–199

    Google Scholar 

  26. Z. Zhang, J. Willson, Z. Lu, W. Wu, X. Zhu, D.-Z. Du, Approximating maximum lifetime k-coverage through minimizing weighted k-cover in homogeneous wireless sensor networks. IEEE/ACM Trans. Netw. 24(6), 3620–3633 (2016)

    Article  Google Scholar 

  27. Z. Zhou, S. Das, H. Gupta, Connected k-coverage problem in sensor networks, in Proceedings of the 13th IEEE International Conference on Computer Communications and Networks (ICCCN’04), Chicago (2004), pp. 373–378

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Wu, W., Zhang, Z., Lee, W., Du, DZ. (2020). k-Coverage. In: Optimal Coverage in Wireless Sensor Networks. Springer Optimization and Its Applications, vol 162. Springer, Cham. https://doi.org/10.1007/978-3-030-52824-9_7

Download citation

Publish with us

Policies and ethics