A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
| Hi-index | 0.00 |
In adhoc networks nodes change their position consistently, and routes are rapidly disturbed, thereby generating route errors and new route discoveries. AOMDV protocol computes multiple loop-free and link-disjoint paths but nodes are unaware of relative movement and location. In this paper a scheme AOMDV-APLP is implemented that makes AOMDV aware of accessibility 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 from which route with the strongest signal strength is selected depending on Link life value predicted by Link Breakage prediction technique. Simulation results show that using accessibility and link life knowledge in route discovery process results in reduction of MAC overhead, routing overhead and average end-to-end delay and improves the Packet delivery ratio to a large extent as compared to standard AOMDV which reflects effective use of network resources. The simulation is done using Ns-2.34 on Fedora 9 Linux environment.