Approximation Algorithms for Sweep Coverage Problem With Multiple Mobile Sensors.
IEEE/ACM Transactions on Networking(2018)
Abstract
Sweep coverage plays an important role in many applications like data gathering, sensing coverage, and devices control. In this paper, we deal with the sweep coverage problem with multiple mobile sensors to periodically cover n targets in the surveillance region. We propose three constant-factor approximations, namely, CycleSplit, HeteroCycleSplit, and PathSplit, to minimize the longest sweep peri...
MoreTranslated text
Key words
Approximation algorithms,Wireless sensor networks,Trajectory,Wireless communication,Measurement,Sensor phenomena and characterization
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined