On Sweep Coverage with Minimum Mobile Sensors

Approximation algorithm for sweep coverage on graph

“…Recently there are several papers [5,9,16,21] found in literature in the area of sweep coverage problem. In [9], Du et al proposed two different heuristics for different movement constraints on the mobile sensors.…”

“…Recently there are several papers [5,9,16,21] found in literature in the area of sweep coverage problem. In [9], Du et al proposed two different heuristics for different movement constraints on the mobile sensors. In the first heuristic: MinExpand, mobile sensors move in the same path in every time period and in the second heuristic: OSweep, the mobile sensor nodes move in different paths in different time periods.…”

TCWTP: Time-Constrained Weighted Targets Patrolling Mechanism in Wireless Mobile Sensor Networks

“…This section introduces previous studies [1], [13], [14], [29], [30] regarding sweep coverage problems. Du et al [29] considered several data mules (DMs) patrolling a set of given POIs with identical quality of monitoring (QoM) requirements.…”

“…Du et al [29] considered several data mules (DMs) patrolling a set of given POIs with identical quality of monitoring (QoM) requirements. Each DM constructed a patrolling circuit passing each POI, and all of the DMs patrolled the POIs along the same constructed circuit.…”

“…1) Satisfying POIs With Distinct Weights: References [29] and [30] have not assigned weights to POIs. Consequently, when some POIs were assigned higher weights (thus requiring more frequent visits), the proposed studies were unable to meet this requirement.…”