A Preemptive On-demand Distance Vector Routing Protocol for Mobile and Wireless Ad Hoc Networks

  • Authors:
  • Azzedine Boukerche;Liqin Zhang

  • Affiliations:
  • -;-

  • Venue:
  • ANSS '03 Proceedings of the 36th annual symposium on Simulation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00



Ad hoc wireless networks are expected to play an increasinglyimportant role in future civilian and military settings where wireless access to wired backboneis either ineffective or impossible.However, frequenttopology changes caused by node mobility make routingin ad hoc wireless networks a challenging problem.In this paper, we present a preemptive ad hoc on-demanddistance vector routing protocol for mobile andwireless ad hoc networks.We present the algorithm,discuss its implementation and report on the performanceresults of simulation of several workload modelson ns-2.Our results indicate that a scheme based on schedulinga path-discovery routine before the current in-uselink breaks is feasible, and that such a mechansim canincrease the number of packets delivered and decreasethe average delay per packet.It also improves thethroughput (packet delivered ratio) and balances thetraffic between different source-destination pairs.