Ad hoc On-Demand Distance Vector (AODV) Routing
01 Jul 2003-Vol. 3561, pp 1-37
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
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.
Citations
More filters
TL;DR: An Agent Based Multicast Routing Scheme (ABMRS) in MANETs, which uses a set of static and mobile agents, offers flexible and adaptable multicast services and also supports component based software development.
59 citations
Patent•
09 Nov 2005
TL;DR: In this article, a system and method for discovering a route between a source node and a destination node in a wireless network, including setting an intermediate reply flag of an route request message by the source node, flooding the wireless network with the route request messages and responding to the route reply message with a routereply message by a first intermediate node having a valid route to the destination node, is described.
Abstract: A system and method for discovering a route between a source node and a destination node in a wireless network including setting an intermediate reply flag of an route request message by the source node, flooding the wireless network with the route request message and responding to the route request message with a route reply message by a first intermediate node having a valid route to the destination node, are described. Also described are a system and method for discovering a best route in which case the route reply message becomes a first route reply message. The system and method for discovering a best route includes selecting by the destination node the best route between itself and the source node based on cumulative metrics received in route request messages received by the destination node, creating a further route reply message and unicasting the further route reply message to the source node.
59 citations
TL;DR: In this article, a process algebra for wireless mesh networks that combines local broadcast, conditional unicast, and data structures is proposed, and the authors model the AODV routing protocol and dis)prove crucial properties such as loop freedom and packet delivery.
Abstract: We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.
59 citations
01 Sep 2011
TL;DR: An ID based dynamic IP configuration scheme that can securely allocate IP addresses to the authorized hosts for a mobile ad hoc network without broadcasting over the entire network without compromising on addressing latency and control overhead.
Abstract: Secure dynamic IP addressing is a prime requirement for unicast communication between authorized hosts in mobile ad hoc networks (MANETs). Recently, several approaches have been proposed for dynamic addressing scheme. However, most of the approaches rely on broadcasting for address solicitation and/or duplicate address detection. As a result, several types of security threats in dynamic IP configuration can be observed. In this paper, we present an ID based dynamic IP configuration scheme that can securely allocate IP addresses to the authorized hosts for a mobile ad hoc network without broadcasting over the entire network. Each host in the MANET can generate an unique IP address from its own IP address for a new host. The proposed scheme provides authentication for address configuration without the help of a trusted third party while taking care of the security-threats associated with dynamic IP configuration. Performance analysis shows that even with added security mechanisms our proposed addressing scheme has fairly good addressing latency and control overhead compared to the similar existing schemes. Moreover, the proposed scheme is able to solve the problem of network partitions and mergers along with the arrival and departure of a host efficiently and securely.
59 citations
26 Sep 2005
TL;DR: It is argued that a routing protocol for ad hoc networks should fully exploit the rich connectivity of the network to improve the reliability of packet delivery and use several good paths to reach destinations, not just the one best path, without imposing excessive control overhead in maintaining such paths.
Abstract: Multipath Routing in Wireless Mesh Networks Marc Mosko ∗ Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, CA 94304 Email: mmosko@parc.com Abstract— This paper addresses multipath routing in a mobile wireless network. We review the premise that a routing protocol should prefer disjoint path construction and argue that using disjoint paths limits route reliability in mobile ad hoc networks compared to using multiple loop-free paths that need not be disjoint. In a mobile ad hoc network, link lifetimes may be relatively short compared to traffic flows. The characteristics of a MANET are significantly different than the networks considered by Kleinrock in his original delay analysis of alternate path routing. In particular, on-demand routing protocols may suffer a significant delay during path discovery. We argue that a routing protocol should exploit the mesh connectivity over non-disjoint loop-free paths to improve s, t-connectedness lifetime in a mobile network. Exploiting mesh connectivity amortizes expensive path discovery operations and may lead to better performance than using disjoint or maximally disjoint paths. I. I NTRODUCTION The main objective of using multipath routing in a mobile ad hoc network is to use several good paths to reach destinations, not just the one best path [1], without imposing excessive control overhead in maintaining such paths. Multipath routing has long been recognized as an important feature in networks to adapt to load and increase reliability [2], [3]. Telecommunication networks adopted alternate path rout- ing, really a form of path failover, in 1984 [4]. Many routing papers on ad hoc routing suggest that the proposed routing protocol may operate correctly (i.e., provide multiple loop- free paths), without specifically addressing the performance of the protocol when multipaths 1 are used [5]–[9]. Other protocols suggest building alternate paths, but without claims of correct operation (e.g. [10]–[13]). Several papers measure route coupling [14]–[16], the mutual interference of routes in a common-channel multi-hop ad hoc network, and find routes with low coupling. Route coupling, however, makes every flow dependent on every other flow through an area and the papers on route coupling do not address the cost of maintaining low- coupled routes in an on-demand protocol; they typically use link-state pro-active protocols. Most of the works on ad hoc multipath restrict the number of potential routes to a small number, usually two. AOMDV [17] allows up to k link-disjoint RREPs, where one is the “quickest” path and the others are chosen from the next link-disjoint RREQs. SMR [18] builds two paths from the quickest RREQ and then collects RREQs 1 We use the term ”multipath” to denote a set of multiple paths to a destination that need not be node or edge disjoint. J.J. Garcia-Luna-Aceves ∗† Computer Engineering Department University of California at Santa Cruz Santa Cruz, CA 95064 Email: jj@soe.ucsc.edu for a period and chooses a second maximally disjoint path from the first. In a zone-disjoint scheme [16], only two paths are built, but they are not necessarily minimum. This scheme uses an iterative algorithm to discard the worst choice each round until only two paths are left. In this paper, we argue that a routing protocol for ad hoc networks should fully exploit the rich connectivity of the network to improve the reliability of packet delivery. In a nutshell, a well-designed multipath routing protocol should find many alternate loop-free paths to destinations and should keep those paths alive by sending some amount of data traffic over them as a function of their quality. Paths with poor quality or significantly longer distance should not be used. The exact methods used by a routing protocol to propagate metrics and distribute load between paths is an open ques- tion. Interestingly, a number of routing protocols for ad hoc networks that attempt to take advantage of multiple paths to destinations advocate the use of node- or edge-disjoint paths. Section II surveys the literature and makes the case that disjoint paths are not necessary to improve the reliability of wireless ad hoc networks. Furthermore, Section III shows that multiple well-connected loop-free paths offer substantially longer path lifetimes than sets of disjoint paths. Based on these results, Section IV illustrates a multipath routing approach in which node or edge disjoint paths are not enforced, using the DOS [19] routing protocol as an example. Section V summarizes the implementation of DOS used in the simulation study presented in Section VI, which compares the path distributions of our loop-free on-demand routing protocol and shows that we can maintain between 1.2 and 1.5 paths per hop, without any special path maintenance mechanisms. In 100-node simulations, the multipath scheme has about 1/3 the network load of min-hop multipath and a slightly higher delivery ratio. II. P RIOR W ORK In the literature, there are several types of disjoint paths. In two node disjoint paths, P 1 and P 2 , there is no common nodes except the first (source) and last (destination). In link disjoint paths, there are no common edges, though there may be common nodes. P 1 = {s, a, b, c, t} and P 2 = {s, m, b, n, t} are two link-disjoint paths, although they share the node b. There are also zone disjoint paths, which try to keep paths separated by some number of hops. Two “maximally”
59 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...Some of these optimizations are also found in the NS2 implementation of DSR and AODV....
[...]
...Per-class, we permit up to 50 packets over all destinations (this is slightly less queuing capacity as found in the DSR and AODV implementations)....
[...]
...28 implementation of AODV [30], for instance, first tries a 5-hop search with 30ms per hop, so AODV would time out after 300ms before trying a 7-hop search which times out after 420ms, and then tries network-wide floods, each timing out after 1....
[...]
...28 implementation of AODV [30], for instance, first tries a 5-hop search with 30ms per hop, so AODV would time out after 300ms before trying a 7-hop search which times out after 420ms, and then tries network-wide floods, each timing out after 1.8s....
[...]
...In DSR and AODV implementations, the routing protocol makes a nexthop determination, then releases many packets to the linklayer without any assurance that the next-hop will be valid by the time the packet arrives at the air interface....
[...]
References
More filters
01 Mar 1997
TL;DR: This document defines these words as they should be interpreted in IETF documents as well as providing guidelines for authors to incorporate this phrase near the beginning of their document.
Abstract: In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. Authors who follow these guidelines should incorporate this phrase near the beginning of their document:
3,501 citations
12 Nov 2001
TL;DR: In this article, a logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Abstract: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument. The radiation detectors are gated differently from each other to provide an indication of formation porosity which is substantially independent of the formation salinity. In the preferred embodiment, the electrical signals indicative of radiation detected by the long-spaced detector are gated for almost the entire interval between neutron pulses and the short-spaced signals are gated for a significantly smaller time interval which commences soon after the termination of a given neutron burst. The signals from the two detectors are combined in a ratio circuit for determination of porosity.
574 citations
01 Jan 1998
TL;DR: In this article, the authors discuss issues that should be considered in formulating a policy for assigning values to a name space and provide guidelines to document authors on the specific text that must be included in documents that place demands on the IANA.
Abstract: Many protocols make use of identifiers consisting of constants and other well-known values. Even after a protocol has been defined and deployment has begun, new values may need to be assigned (e.g., for a new option type in DHCP, or a new encryption or authentication algorithm for IPSec). To insure that such quantities have consistent values and interpretations in different implementations, their assignment must be administered by a central authority. For IETF protocols, that role is provided by the Internet Assigned Numbers Authority (IANA). In order for the IANA to manage a given name space prudently, it needs guidelines describing the conditions under which new values can be assigned. If the IANA is expected to play a role in the management of a name space, the IANA must be given clear and concise instructions describing that role. This document discusses issues that should be considered in formulating a policy for assigning values to a name space and provides guidelines to document authors on the specific text that must be included in documents that place demands on the IANA.
536 citations
01 Oct 1998
TL;DR: Many protocols make use of identifiers consisting of constants and other well-known values that must be administered by a central authority to insure that such quantities have consistent values and interpretations in different implementations.
Abstract: Many protocols make use of identifiers consisting of constants and other well-known values. Even after a protocol has been defined and deployment has begun, new values may need to be assigned (e.g., for a new option type in DHCP, or a new encryption or authentication algorithm for IPSec). To insure that such quantities have consistent values and interpretations in different implementations, their assignment must be administered by a central authority. For IETF protocols, that role is provided by the Internet Assigned Numbers Authority (IANA).
334 citations
01 Jun 2004
TL;DR: This document defines terms for mobility related terminology out of work done in the Seamoby Working Group but has broader applicability for terminology used in IETF-wide discourse on technology for mobility and IP networks.
Abstract: There is a need for common definitions of terminology in the work to
be done around IP mobility. This document defines terms for mobility
related terminology. The document originated out of work done in the
Seamoby Working Group but has broader applicability for terminology
used in IETF-wide discourse on technology for mobility and IP
networks. Other working groups dealing with mobility may want to take
advantage of this terminology. This memo provides information for the
Internet community.
207 citations
"Ad hoc On-Demand Distance Vector (A..." refers methods in this paper
...This section defines other terminology used with AODV that is not already defined in [3]....
[...]