Adaptive Probabilistic Proactive Routing for Dense MANETs

الملخص EN

Conventional proactive routing protocols, due to their inherent nature based on shortest paths, select longer links which are amenable to rapid breakages as nodes move around.

In this paper, we propose a novel adaptive probabilistic approach to handle routing information in dense mobile ad hoc networks in a way to improve the proactive routing pertinence as a function of network dynamics.

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