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...

Descripción completa

Detalles Bibliográficos
Autores principales: Uwitonze, Alfred, Huang, Jiaqing, Ye, Yuanqing, Cheng, Wenqing
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2017
Materias:
Article
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

Internet

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