scispace - formally typeset

Destination-Sequenced Distance Vector routing

About: Destination-Sequenced Distance Vector routing is a(n) research topic. Over the lifetime, 20341 publication(s) have been published within this topic receiving 490663 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 accessProceedings ArticleDOI: 10.1109/MCSA.1999.749281
C.E. Perkins, E.M. Royer1Institutions (1)
25 Feb 1999-
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. 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 self starting 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. more

11,180 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

Open accessProceedings ArticleDOI: 10.1145/345910.345955
Sergio Marti1, TJ Giuli1, Kevin Lai1, Mary Baker1Institutions (1)
01 Aug 2000-
Abstract: This paper describes two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this problem, we propose categorizing nodes based upon their dynamically measured behavior. We use a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes. Through simulation we evaluate watchdog and pathrater using packet throughput, percentage of overhead (routing) transmissions, and the accuracy of misbehaving node detection. When used together in a network with moderate mobility, the two techniques increase throughput by 17% in the presence of 40% misbehaving nodes, while increasing the percentage of overhead transmissions from the standard routing protocol's 9% to 17%. During extreme mobility, watchdog and pathrater can increase network throughput by 27%, while increasing the overhead transmissions from the standard routing protocol's 12% to 24%. more

3,697 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

J.J. Garcia-Luna-Aceves

86 papers, 4.1K citations

Jie Wu

84 papers, 3.5K citations

Mario Gerla

67 papers, 7.6K citations

José Duato

48 papers, 2.9K citations

Hussein T. Mouftah

21 papers, 437 citations

Network Information
Related Topics (5)
Dynamic Source Routing

32.2K papers, 695.7K citations

95% related
Routing protocol

46.5K papers, 901.8K citations

95% related
Mobile wireless sensor network

26.5K papers, 621.7K citations

94% related
Link-state routing protocol

31.7K papers, 676.8K citations

94% related
Wireless Routing Protocol

28.9K papers, 689.5K citations

94% related