A preemptive on-demand distance vector routing protocol for mobile and wireless ad hoc networks

Ad hoc wireless networks are expected to play an increasingly important role in future civilian and military settings where wireless access to wired backbone is either ineffective or impossible. However, frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenging problem. In this paper, we present a preemptive ad hoc on-demand distance vector routing protocol for mobile and wireless ad hoc networks. We present the algorithm, discuss its implementation and report on the performance results of simulation of several workload models on ns-2. Our results indicate that a scheme based on scheduling a path-discovery routine before the current in-use link breaks is feasible, and that such a mechanism can increase the number of packets delivered and decrease the average delay per packet. It also improves the throughput (packet delivered ratio) and balances the traffic between different source-destination pairs.