Performance Analysis of Ad-hoc On Demand Multipath Distance Vector Routing Protocol with Accessibility and Link Breakage Prediction
Amruta Chintawar, Madhumita Chatterjee, Amar Vidhate · 2011
Mobile Ad-Hoc is a self-organizing network without centralized control, where each node acts as router to attain coverage over multiple hops. Routing plays a very important role. Some of the well-established routing protocols are AODV and AOMDV. Mobility results in disturbed routes thereby generating route errors and new route discoveries. Existing protocol like AOMDV computes multiple loop-free and link-disjoint paths but nodes are unaware of relative movement and location. In this work we present a scheme to integrate Accessibility prediction and Link breakage prediction with AOMDV. Our scheme AOMDV-APLP makes AOMDV aware of access of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and maintain it in their routing table. Based on this information route discovery is restricted to only “accessible ” and “start” nodes. Multiple paths are generated by accessibility prediction and from these paths route with the strongest signal strength is selected depending on Link life value predicted by Link Breakage prediction technique. Simulations were done on Ns-2.34 on Fedora 9 Linux environment. Experiments show that our protocol results in reduction of MAC overhead, routing overhead and average endto-end delay it also improves the Packet delivery ratio to a large extent as compared to standard AOMDV. A comparison is done with AODV-APLP and results show that AOMDV-APLP performs better.