• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Ad-hoc On-Demand Distance Vector Routing (1997)

Cached

  • Download as a PDF

Download Links

  • [www.ronai.hu]
  • [www.cs.jhu.edu]
  • [www.cs.jhu.edu]
  • [www-rcf.usc.edu]
  • [www.ee.iitb.ac.in]
  • [cst.mi.fu-berlin.de]
  • [cst.mi.fu-berlin.de]
  • [cst.mi.fu-berlin.de]
  • [www.cs.colorado.edu]
  • [cs.uccs.edu]
  • [www.cs.ucf.edu]
  • [cs.uccs.edu]
  • [www.cs.ucf.edu]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [courses.csail.mit.edu]
  • [www.cs.colorado.edu]
  • [cs.uccs.edu]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cse.iitb.ac.in]
  • [www.cs.cmu.edu]
  • [www.cs.ucsb.edu]
  • [www.research.att.com]
  • [www.it.uu.se]
  • [www.comp.nus.edu.sg]
  • [www.engr.uconn.edu]
  • [www.cs.ucsb.edu]
  • [www.cs.ucsb.edu]
  • [cs.ucsb.edu]
  • [cs.ucsb.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Charles E. Perkins , Elizabeth M. Royer
Venue:IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
Citations:3235 - 14 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Perkins97ad-hocon-demand,
    author = {Charles E. Perkins and Elizabeth M. Royer},
    title = {Ad-hoc On-Demand Distance Vector Routing},
    booktitle = {IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS},
    year = {1997},
    pages = {90--100},
    publisher = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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 infrastructure. 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.

Keyphrases

ad-hoc network    mobile node    ad-hoc on-demand distance vector    evaluation methodology    specialized router    dynamic selfstarting network    present ad-hoc    broken link    required intervention    basic distance-vector    periodic advertisement    demand distance vector routing    overall bandwidth    mobile host    large population    centralized access point    simulation result    cooperative engagement    novel algorithm    loop-free route   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University