Cargando…
Maximum Target Coverage Problem in Mobile Wireless Sensor Networks
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing the covered targets under the constraint that the ma...
Autores principales: | Liang, Dieyan, Shen, Hong, Chen, Lin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7795209/ https://www.ncbi.nlm.nih.gov/pubmed/33383935 http://dx.doi.org/10.3390/s21010184 |
Ejemplares similares
-
Target Coverage in Wireless Sensor Networks with Probabilistic Sensors
por: Shan, Anxing, et al.
Publicado: (2016) -
Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines
por: Liang, Dieyan, et al.
Publicado: (2021) -
The Coverage Problem in Video-Based Wireless Sensor Networks: A Survey
por: Costa, Daniel G., et al.
Publicado: (2010) -
On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks
por: Yu, Jiguo, et al.
Publicado: (2016) -
Using Adaptive Sensors for Optimised Target Coverage in Wireless Sensor Networks
por: Akram, Junaid, et al.
Publicado: (2022)