Preemptive AOMDV routing for mobile Ad-hoc networks

An Ad hoc network will often change rapidly in topology, this courses for routes in the network to often disappear and new to arise. The Ad-hoc On-Demand Distance Vector Routing Protocol(AODV), is based on the principle of discover routes as needed. The Ad Hoc On Demand Distance Vector (AODV) routing protocol performs better than the table-driven protocol. Link failure caused by node mobility is a common feature of multi-hop, wireless ad hoc networks. With a reactive routing protocol such as AODV (Ad hoc On-demand Distance Vector), this leads to increased delay and routing overheads while route repair procedures are carried out. In this paper we will extend the definition of A OD V with the ability to discover multiple routes to a host and switch between them, if an active route is be coming weak and there is a risk that it will disappear. We will refer to it as "pre-emptive AOMDV". We will show that the performance of pre-emptive AOMDV do handle changes in topology better than AODV it self. To show the effect of extending AODV, the suggested protocol is implemented in a simulator. Performance enhancements will be presented from different scenarios, to compare pre-emptive AOMDV with the ordinary AODV.