2021
DOI: 10.3390/s21041457
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines

Abstract: As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection. For a set of PoIs in an Eulerian graph, the point sweep coverage problem of deploying the fewest sensors to periodically cover a set of PoIs is known to be Non-deterministic Polynomial Hard (NP-hard), even if all sensors have the same velocity. In this paper, we … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 30 publications
0
0
0
Order By: Relevance
“…This strategy is inspired from linearized coverage [43] where the total area of surveillance E as given in Equation ( 1) is divided horizontally in two sections E 1 and E 2 . The watch agents W n are divided into two groups G 1 and G 2 .…”
Section: Two-layer Sweep Strategymentioning
confidence: 99%
“…This strategy is inspired from linearized coverage [43] where the total area of surveillance E as given in Equation ( 1) is divided horizontally in two sections E 1 and E 2 . The watch agents W n are divided into two groups G 1 and G 2 .…”
Section: Two-layer Sweep Strategymentioning
confidence: 99%