Ad hoc on-demand multipath distance vector routing: Research Articles

  • Authors:
  • Mahesh K. Marina;Samir R. Das

  • Affiliations:
  • Computer Science Department, University of California, Los Angeles, CA 90095-1596, U.S.A.;Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY 11794-4400, U.S.A.

  • Venue:
  • Wireless Communications & Mobile Computing - Wireless Ad Hoc Networks: Technologies and Challenges
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop an on-demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.