Cargando…
Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs
Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the...
Autores principales: | Cho, Eun-Seok, Yim, Yongbin, Kim, Sang-Ha |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5677345/ https://www.ncbi.nlm.nih.gov/pubmed/29053623 http://dx.doi.org/10.3390/s17102402 |
Ejemplares similares
-
A Fast Neighbor Discovery Algorithm in WSNs†
por: Wei, Liangxiong, et al.
Publicado: (2018) -
An Energy-Efficient Routing Algorithm for WSNs Using Fuzzy Logic
por: Rao, Preetha R., et al.
Publicado: (2023) -
An Energy Efficient Routing Approach for IoT Enabled Underwater WSNs in Smart Cities
por: Usman, Nighat, et al.
Publicado: (2020) -
Fuzzy-Based Trust Prediction Model for Routing in WSNs
por: Anita, X., et al.
Publicado: (2014) -
VN-NDP: A Neighbor Discovery Protocol Based on Virtual Nodes in Mobile WSNs
por: Zhang, Yuanyuan, et al.
Publicado: (2019)