Answers are grounded in this paper and cite their sources.
Proposes an approximation algorithm to improve monitoring efficiency in sensor networks, suggesting better coverage methods.
In a sweep coverage problem, mobile sensors periodically and timely visit Points of Interest (PoIs) to collect information. A PoI is said to be sweep-covered if it is visited at least once within every time period t. This paper proposes a new variant: the Dominating Sweep Cover (DSC) problem, which aims to monitor all nodes by periodically visiting a dominating set of the network using the minimum number of mobile sensors. By leveraging the relation between the DSC problem and the Group Steiner Tree (GST) problem, we design an approximation algorithm for DSC with an approximation ratio of O(log 4 n), where n is the number of nodes in the network.
No takes yet. Share an insight, caveat, or question.
Fan et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: