Abstract:
Abstract — We show that the way in which the Ad-hoc Ondemand Distance Vector (AODV) protocol handles destinationbased sequence numbers can lead to looping of data packets, defacto network partitions, and counting to infinity in the presence of link or node failures in ad hoc networks using an unreliable medium access control (MAC) protocol like the IEEE 802.11 DCF. The source of AODV’s problems with sequence numbers is the use of a delete period after which nodes are allowed to forget invalid routes to destinations. We present a new approach for the handling of sequence numbers in AODV that eliminates the use of delete periods for destination-based sequence numbers, and show with simulation experiments that the new approach performsthesameorbetterthanAODV. I.
Citations
|
29
|
et al., “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks Internet Draft),” www.ietf.org/internet-drafts/draft-ietf-manet-dsr-07.txt
– Johnson
- 2002
|
|
12
|
et al., “Ad hoc On-Demand Distance Vector (AODV) Routing,” Request for Comments 3561
– Perkins
- 2003
|
|
11
|
Optimized Link State Routing Protocol,” Request for Comments 3626
– Clausen, Jacquet
- 2003
|
|
10
|
et al. “Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks
– Perkins
- 2001
|
|
9
|
Aodv-pa: Aodv with path accumulation
– Gwalani, Belding-Royer, et al.
- 2003
|
|
8
|
Garcia-Luna-Aceves. Using Labeled Paths for Loopfree On-demand Routing in Ad Hoc Networks
– Rangarajan, J
- 2004
|
|
7
|
A new approach to on-demand loop-free routing in ad hoc networks
– Garcia-Luna-Aceves, Mosko, et al.
- 2003
|
|
6
|
Fault Origin Adjudication
– Bhargavan, Gunther, et al.
- 2000
|
|
5
|
A new framework for loop-free on-demand routing using destination sequence numbers
– Garcia-Luna-Aceves, Rangarajan
- 2004
|
|
5
|
et al., “Topology Dissemination Based on Reverse-Path Forwarding (TBRPF),”Request for Comments 3684
– Ogier
- 2004
|
