Abstract
We first propose a new proactive routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities.
Conducted simulations show that our proposal yields substantially better routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to overcome this side effect and defined two probabilistic proactive routing variants. Conducted simulations show that our proposed bounded probabilistic proactive routing schemes outperform conventional routing protocols and yield up to 66 percent increase in throughput.