• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

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

Cached

  • Download as a PDF

Download Links

  • [www.ronai.hu]
  • [www.cs.jhu.edu]
  • [www-rcf.usc.edu]
  • [www.cs.colorado.edu]
  • [cs.uccs.edu]
  • [www.cs.ucf.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cmu.edu]
  • [www.cs.ucsb.edu]
  • [www.research.att.com]
  • [www.comp.nus.edu.sg]
  • [www.engr.uconn.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:1718 - 13 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3
  • Version 4

Version History

Metadata Version 4

User correction supplied by mph

DatumValueSource
TITLE Ad-hoc On-Demand Distance Vector Routing user correction - Legacy Corrections
AUTHOR NAME Charles E. Perkins user correction
AUTHOR AFFIL Sun Microsystems Laboratories; Advanced Development Group; Mobile Networking, Wireless user correction
AUTHOR ADDR Menlo Park, CA 94025 user correction
AUTHOR NAME Elizabeth M. Royer user correction
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. user correction
YEAR 1997 user correction - Legacy Corrections
VENUE IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS user correction
VENUE TYPE CONFERENCE INFERENCE
PAGES 90--100 INFERENCE
CITATIONS 22 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2010 The Pennsylvania State University