Cargando…
Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines
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 poin...
Autores principales: | Liang, Dieyan, Shen, Hong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7922606/ https://www.ncbi.nlm.nih.gov/pubmed/33669745 http://dx.doi.org/10.3390/s21041457 |
Ejemplares similares
-
Maximum Target Coverage Problem in Mobile Wireless Sensor Networks
por: Liang, Dieyan, et al.
Publicado: (2020) -
A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors
por: Shan, Anxing, et al.
Publicado: (2017) -
ALICE makes a clean sweep at Point 2
Publicado: (2001) -
To Sweep and Dust
Publicado: (1881) -
Versatile Detection of Diverse Selective Sweeps with Flex-Sweep
por: Lauterbur, M Elise, et al.
Publicado: (2023)