SECAN-Lab
   Home
   News

Projects
   SECAN-LAB
   Mesh Sequencer
   U-2010
   NARTUS
   EFIPSANS
   IRMA
   SECRICOM

The Group
   Members
   Publications
   Theses
   Teaching
   Presentations

Topics
   Mobile Computing
   Ad-Hoc Networks
   Ad-Hoc Protocols
   Mesh Computing
   Trust

Related Stuff
   L-101 Laboratory Systems
   AS28 Systems
   802.11 Network Simulator
   Internships
   Conferences
   Publications
   Standards
   Projects
   Links
   Partners
   OSTN

Miscellaneous
   Contact
   About
   Job Opportunities
   Search

Perkins1999

Ad-hoc On-Demand Distance Vector Routing

Charles E. Perkins
Charles E. Perkins
Sun Microsystems Laboratories
Advanced Developement Group
Menlo Park, CA 94025
cperkins@eng.sun.com

Elizabeth M. Royer
Department of Electrical and Computer Engeneering
University of California, Santa Barbara
Santa Barbara, CA 93106
eroyer@alpha.ece.ucsb.edu

2nd IEEE Workshop on Mobile Computing Systems and Applications, WMCSA '99
February 25-26, 1999
New Orleans, Lousiana, USA
pp. 90-100
IEEE

Citeseer:


Paper:


see [Perkins1997] for original internet-draft
see [Perkins2001b] for book-article
see [Perkins2003] for last version of the internet-draft
see [RFC3561] for RFC.

Abstract

An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing in- frastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each Mobile Host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic selfstarting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance-vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

BibTeX

@INPROCEEDINGS(Perkins1999,
   TITLE = {Ad-hoc On-Demand Distance Vector Routing},
   AUTHOR = {Charles E. Perkins and Elizabeth M. Royer},
   BOOKTITLE = {2nd IEEE Workshop on Mobile Computing Systems and Applications, WMCSA '99, February 25-26, 1999, New Orleans, Lousiana, USA},
   PAGES = {90-100},
   ORGANIZATION = {IEEE},
   PUBLISHER = {IEEE},
   MONTH = {February},
   YEAR = {1999},
   URL = {http://www.research.att.com/conf/wmcsa99/papers/perkins.ps.gz},
   FILE = {Perkins1999.pdf},
)


"Perkins1999" is mentioned on: Ad Hoc On-Demand Distance Vector Routing Protocol | Ad-Hoc Protocols (Classification) | Ad-Hoc Protocols (History) | Ad-Hoc-Papers | Perkins1997 | Perkins2001b | Perkins2003 | RFC3561

(C) 2004-2006 University of Luxembourg, SECAN-Lab

Printable Version
VeryQuickWiki - HTML Export
Version: 2.7.1 (UniLux: 1.15.0 2006-01-19)
Modified: 2006-01-09 17:55:01
Exported: 2010-03-14 02:38:25