Sweep-Coverage

Weili Wu, Zhao Zhang, Wonjun Lee and Ding-Zhu Du
Additional contact information
Weili Wu: University of Texas at Dallas
Zhao Zhang: Zhejiang Normal University
Wonjun Lee: Korea University
Ding-Zhu Du: University of Texas at Dallas

Chapter Chapter 11 in Optimal Coverage in Wireless Sensor Networks, 2020, pp 183-192 from Springer

Abstract: 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.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-52824-9_11

Ordering information: This item can be ordered from
http://www.springer.com/9783030528249

DOI: 10.1007/978-3-030-52824-9_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().