Cargando…
Connectivity Restoration in Wireless Sensor Networks via Space Network Coding
The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomia...
Autores principales: | Uwitonze, Alfred, Huang, Jiaqing, Ye, Yuanqing, Cheng, Wenqing |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5426826/ https://www.ncbi.nlm.nih.gov/pubmed/28425923 http://dx.doi.org/10.3390/s17040902 |
Ejemplares similares
-
Exact and heuristic algorithms for Space Information Flow
por: Uwitonze, Alfred, et al.
Publicado: (2018) -
Adaptive Connectivity Restoration from Node Failure(s) in Wireless Sensor Networks
por: Wang, Huaiyuan, et al.
Publicado: (2016) -
Fault-Tolerant Algorithms for Connectivity Restoration in Wireless Sensor Networks
por: Zeng, Yali, et al.
Publicado: (2015) -
Networked filtering and fusion in wireless sensor networks
por: Mahmoud, Magdi S, et al.
Publicado: (2015) -
On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks
por: Yu, Jiguo, et al.
Publicado: (2016)