By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Boukerche ; Dept. of Comput. Sci., North Texas Univ., TX, USA ; Liqin Zhang

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.

Published in:

Simulation Symposium, 2003. 36th Annual

Date of Conference:

30 March-2 April 2003