Stability routing with constrained path length for improved routability in dynamic MANETs
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
In this paper, we propose a novel routing algorithm based on the network cartography which is collected using an asynchronous distributed cartography gathering algorithm. Each node senses its own dynamics and chooses locally an appropriate routing size. As such stationary nodes generate little signaling traffic, however fast moving nodes choose small routing periods to mitigate the effect of mobility. Moreover, every node integrates a self regulating process that dynamically regulates the already chosen routing period to track the timely evolution of the node dynamics. The performance of our proposed routing protocol are evaluated and compared to the known OLSR through extensive simulations. First, we show that the collected network cartography maintains over time a validity ratio above 97 percent even for high node speed. Second, while our proposed routing protocol provides around 97 percent routing validity, the OLSR can hardly deliver more than 60 percent. Third, the proposed protocol provides much more throughput than OLSR and much less end to end delay at moderate to high speeds and workloads.