Cargando…
PDTR: Probabilistic and Deterministic Tree-based Routing for Wireless Sensor Networks
This paper proposed a “Probabilistic and Deterministic Tree-based Routing for WSNs (PDTR)”. The PDTR builds a tree from the leaves to the head (sink), according to the best elements in the initial probabilistic routing table, measured by the product of hops-count distribution, and transmission dista...
Autores principales: | Ghoul, Rafia, He, Jing, Djaidja, Sana, A. A. Al-qaness, Mohammed, Kim, Sunghwan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7146286/ https://www.ncbi.nlm.nih.gov/pubmed/32197423 http://dx.doi.org/10.3390/s20061697 |
Ejemplares similares
-
ZERO: Probabilistic Routing for Deploy and Forget Wireless Sensor Networks
por: Vilajosana, Xavier, et al.
Publicado: (2010) -
Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks
por: Moya, José M., et al.
Publicado: (2009) -
DCBRP: a deterministic chain-based routing protocol for wireless sensor networks
por: Marhoon, Haydar Abdulameer, et al.
Publicado: (2016) -
Deterministic networks for probabilistic computing
por: Jordan, Jakob, et al.
Publicado: (2019) -
An Enhanced Tree Routing Based on Reinforcement Learning in Wireless Sensor Networks †
por: Kim, Beom-Su, et al.
Publicado: (2022)