Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad Hoc Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Hi-index | 0.00 |
Routing in Mobile Ad hoc Networks (MANETs) is central to their proper functioning. Mobility in such networks makes the routing a real challenging task. Although a host of studies has been reported in the literature evaluating the performance of proposed routing algorithms, a deeper insight reveals some residual malfunctioning. On the other hand, routes validity plays a central leveraging mission to enhance network performances. Forwarding through incorrect routes not only results in traffic wondering inside the network without ever being able to be delivered to their ultimate destinations but also over consumes valuable network resources. As nodes' mobility gets higher, the routing period gets smaller to be able to correctly tracks changes in the topology. An adequate trade off should then be found between the size of the routing period which controls the amount of traffic overhead and the validity of routes which governs the performances of the network. In this paper, we first unleash the cover on some interesting residual misbehavior of proactive routing and propose some simple solutions. Next, we propose a distributed algorithm to collect the network cartography. We study the validity of the network cartography as a function of time, load and mobility. This cartography is then used to dynamically self regulate the routing period size to be used in a way to minimize the routing overhead and to maximize the routing pertinence. Simulation results show that our proposed scheme tracks correctly changes in the network dynamics and properly adjusts the current routing period size.