scispace - formally typeset

Ad hoc On-Demand Distance Vector Routing

About: Ad hoc On-Demand Distance Vector Routing is a(n) research topic. Over the lifetime, 8633 publication(s) have been published within this topic receiving 201509 citation(s). more


Open access
01 Jul 2003-
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols. more

11,293 Citations

Open accessBook ChapterDOI: 10.1007/978-0-585-29603-6_5
David B. Johnson1, David A. Maltz1Institutions (1)
01 Jan 1996-
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal. more

  • Figure 7 Average route length used relative to optimal (20 runs)
    Figure 7 Average route length used relative to optimal (20 runs)
  • Figure 2 An example ad hoc network illustrating use of the route cache
    Figure 2 An example ad hoc network illustrating use of the route cache
  • Figure 4 Mobile host B is returning a route error packet to A
    Figure 4 Mobile host B is returning a route error packet to A
  • Figure 6 Example of disconnected clusters with 24 hosts
    Figure 6 Example of disconnected clusters with 24 hosts
  • Figure 1 A simple ad hoc network of three wireless mobile hosts
    Figure 1 A simple ad hoc network of three wireless mobile hosts
  • + 3

8,185 Citations

Open accessProceedings ArticleDOI: 10.1145/190809.190336
Charles E. Perkins1, Pravin Bhagwat2Institutions (2)
01 Oct 1994-
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks. more

6,770 Citations

Proceedings ArticleDOI: 10.1145/288235.288256
J. Broch1, David A. Maltz1, David B. Johnson1, Yih-Chun Hu1  +1 moreInstitutions (1)
25 Oct 1998-
Abstract: An ad hoc networkis a collwtion of wirelessmobilenodes dynamically forminga temporarynetworkwithouttheuseof anyexistingnetworkirrfrastructureor centralizedadministration.Dueto the limitedtransmissionrange of ~vlrelessnenvorkinterfaces,multiplenetwork“hops”maybe neededfor onenodeto exchangedata ivithanotheracrox thenetwork.Inrecentyears, a ttiery of nelvroutingprotocols~geted specificallyat this environment havebeen developed.but little pcrfomrartwinformationon mch protocol and no ralistic performancecomparisonbehvwrrthem ISavailable. ~Is paper presentsthe results of a derailedpacket-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocolsthatcovera range of designchoices: DSDV,TORA, DSR and AODV. \Vehave extended the /~r-2networksimulatorto accuratelymodelthe MACandphysical-layer behaviorof the IEEE 802.1I wirelessLANstandard,includinga realistic wtrelesstransmissionchannelmodel, and present the resultsof simulations of net(vorksof 50 mobilenodes. more

5,118 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

Leonard Barolli

29 papers, 283 citations

J.J. Garcia-Luna-Aceves

27 papers, 478 citations

Mario Gerla

24 papers, 4K citations

Makoto Ikeda

15 papers, 101 citations

Fatos Xhafa

13 papers, 108 citations

Network Information
Related Topics (5)
Mobile ad hoc network

31.5K papers, 634.9K citations

94% related
Link-state routing protocol

31.7K papers, 676.8K citations

93% related
Dynamic Source Routing

32.2K papers, 695.7K citations

93% related
Wireless Routing Protocol

28.9K papers, 689.5K citations

92% related
Optimized Link State Routing Protocol

26.2K papers, 641.5K citations

92% related