Nature inspired node density estimation for molecular nanonetworks

Saeed, Taqwa; Lestas, Marios; Pitsillides, Andreas

doi:10.1016/j.nancom.2017.02.003

Cited by 2 publications

(1 citation statement)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An adaptive probabilistic mechanism based on the wave propagation is proposed in [50], while an energy efficient routing algorithm using probabilistic flooding is proposed in [51]. Probabilistic flooding has also been proposed for the area of nanonetworks by [52,53], and underwater environments by [54], whereas vehicular networks have also been the focus by [55,56]. An adaptive version for multi-path routing purposes is proposed by [57].…”

Section: Past Related Workmentioning

confidence: 99%

Adapting Probabilistic Flooding in Energy Harvesting Wireless Sensor Networks

Koufoudakis

Οικονόμου

Tsoumanis

2018

JSAN

View full text Add to dashboard Cite

Technological advantages in energy harvesting have been successfully applied in wireless sensor network environments, prolonging network’s lifetime, and, therefore, classical networking approaches like information dissemination need to be readdressed. More specifically, Probabilistic Flooding information dissemination is revisited in this work and it is observed that certain limitations arise due to the idiosyncrasies of nodes’ operation in energy harvesting network environments, resulting in reduced network coverage. In order to address this challenge, a modified version of Probabilistic Flooding is proposed, called Robust Probabilistic Flooding, which is capable of dealing with nodes of about to be exhausted batteries that resume their operation after ambient energy collection. In order to capture the behavior of the nodes’ operational states, a Markov chain model is also introduced and—based on certain observations and assumptions presented here—is subsequently simplified. Simulation results based on the proposed Markov chain model and a solar radiation dataset demonstrate the inefficiencies of Probabilistic Flooding and show that its enhanced version (i.e., Robust Probabilistic Flooding) is capable of fully covering the network on the expense of increased termination time in energy harvesting environments. Another advantage is that no extra overhead is introduced regarding the number of disseminated messages, thus not introducing any extra transmissions and therefore the consumed energy does not increase.

show abstract