Skip to main content

Sweep-Coverage

  • Chapter
  • First Online:
Optimal Coverage in Wireless Sensor Networks

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

  • 535 Accesses

Abstract

In all previous coverage problems, targets or areas are required to be monitored all the time. But in many applications typically featured as patrolling, target points are only required to be monitored with certain frequency. For example, a set of static sensors are distributed in a forest, surveilling ecological environment. Information collected by those static sensors are gathered by a set of mobile sensors, say, at least once every three hours. One may be wondering what is the minimum number of mobile sensors that are needed to accomplish such a task, and how to design trajectories for those mobile sensors. Motivated by such a consideration, Cheng et al. proposed the following dynamic coverage problem.

You can’t sweep other people off their feet, if you can’t be swept off your own.

Clarence Day

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

Bibliography

  1. Z. Chen, S. Wu, X. Zhu, X. Gao, J. Gu, G. Chen, A route scheduling algorithm for the sweep coverage problem, in 2015 IEEE 35th International Conference on Distributed Computing Systems (2015), pp. 750–751

    Google Scholar 

  2. Z. Chen, X. Zhu, X. Gao, F. Wu, J. Gu, G. Chen, Efficient scheduling strategies for mobile sensors in sweep coverage problem, in 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON) (2016)

    Google Scholar 

  3. B. Chen, H. Du, C. Liu, Q. Ye, On the impact of sweep radius and energy limitation on sweep coverage in wireless sensor networks, 2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) (2018), pp. 1–7

    Google Scholar 

  4. W. Cheng, M. Li, K. Liu, Y. Liu, X. Li, X. Liao, Sweep coverage with mobile sensors, in IEEE International Symposium on Parallel and Distributed Processing (IPDPS) (2008)

    Google Scholar 

  5. Y. Feng, X. Gao, F. Wu, G. Chen, Shorten the trajectory of mobile sensors in sweep coverage problem, in 2015 IEEE Global Communications Conference (GLOBECOM) (2015), pp. 1–6

    Google Scholar 

  6. X. Gao, X. Zhu, Y. Feng, F. Wu, G. Chen, Data ferry trajectory planning for sweep coverage problem with multiple mobile sensors, in IEEE International Conference on Sensing, Communication, and Networking (SECON) (2016), pp. 27–30

    Google Scholar 

  7. X. Gao, J. Fan, F. Wu, G. Chen, Approximation algorithms for sweep coverage problem with multiple mobile sensors. IEEE/ACM Trans. Netw. 26(2), 990–1003 (2018)

    Article  Google Scholar 

  8. B. Gorain, P.S. Mandal, Approximation algorithm for sweep coverage in wireless sensor networks. J. Parallel Distrib. Comput. 2699–2707 (2014)

    Google Scholar 

  9. B. Gorain, P.S. Mandal, Approximation algorithm for sweep coverage on graph. Inf. Process. Lett. 115, 712–718 (2015)

    Article  MathSciNet  Google Scholar 

  10. D. Kim, R.N. Uma, B.H. Abay, W. Wu, W. Wang, A.O. Tokuta, Minimum latency multiple data mule trajectory planning in wireless sensor networks. IEEE Trans. Mob. Comput. 13(4), 838–851 (2014)

    Article  Google Scholar 

  11. M. Li, W. Cheng, K. Liu, Y. He, X.-Y. Li, X. Liao, Sweep coverage with mobile sensors. IEEE Trans. Mob. Comput. 10(11), 1534–1545 (2011)

    Article  Google Scholar 

  12. J. Liang, X. Huang, Z. Zhang, Approximation algorithms for distance constraint sweep coverage with base stations. J. Comb. Optim. 37(4), 1111–1125 (2019)

    Article  MathSciNet  Google Scholar 

  13. C. Liu, H. Du, Q. Ye, Sweep coverage with return time constraint, in 2016 IEEE Global Communications Conference (GLOBECOM) (2016), pp. 1–6

    Google Scholar 

  14. C. Liu, H. Du, Q. Ye, Utilizing communication range to shorten the route of sweep coverage, in 2017 IEEE International Conference on Communications (ICC) (2017), pp. 1–6

    Google Scholar 

  15. X. Lu, S. Chen, W. Chen, D. Li, Sweep coverage with mobile sensors on two-way road, in China Conference on Wireless Sensor Networks (2012), pp. 335–345

    Google Scholar 

  16. V.V. Vazirani, Approximation Algorithms (Springer, Berlin, 2001)

    MATH  Google Scholar 

  17. L. Xue, D. Kim, Y. Zhu, D. Li, W. Wang, A,O. Tokuta, Multiple heterogeneous data ferry trajectory planning in wireless sensor networks, in IEEE INFOCOM 2014 – IEEE Conference on Computer Communications (2014), pp. 2274–2282

    Google Scholar 

  18. M. Yang, D. Kim, D. Li, W. Chen, H. Du, A.O. Tokuta, Sweep-coverage with energy-restricted mobile wireless sensor nodes, in Wireless Algorithms, Systems, and Applications. Lecture Notes in Computer Science, vol. 7992 (2013), pp. 486–497

    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). Sweep-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_11

Download citation

Publish with us

Policies and ethics