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
13 Apr 2012
TL;DR: An overview of several well-known MANET routing protocols and the implementation details of the DSDV routing protocol in the ns-3 network simulator is presented and its performance under various scenarios is analysed.
Abstract: Routing protocols are a critical aspect to performance in mobile wireless networks The development of new protocols requires testing against well-known protocols in various simulation environments In this paper we present an overview of several well-known MANET routing protocols and the implementation details of the DSDV routing protocol in the ns-3 network simulator We analyse DSDV routing performance under various scenarios and compare its performance with the other protocols implemented in ns-3, AODV and OLSR Our results verify the implementation of DSDV and show performance comparable to that of OLSR
61 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...…Model Development, Model Validation and Analysis; C.2.2 [ComputerCommunication Networks]: Network Protocols — routing protocols General Terms Algorithms, Design, Performance, Verification Keywords DSDV, ns-3, DSDV model implementation, MANET routing protocol, ns-3 simulation methodology, AODV, OLSR...
[...]
...The relation between all the classes implemented in this module are shown in Figure 1....
[...]
TL;DR: This work describes a form of predicate abstraction that constructs a formula over a set of universally quantified variables to describe invariant properties of the first-order state variables.
Abstract: Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state variables, where the system state includes mutable functions and predicates. Such a model can describe systems containing arbitrarily large memories, buffers, and arrays of identical processes. We describe a form of predicate abstraction that constructs a formula over a set of universally quantified variables to describe invariant properties of the first-order state variables. We provide a formal justification of the soundness of our approach and describe how it has been used to verify several hardware and software designs, including a directory-based cache coherence protocol.
61 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...The automatic predicate discovery methods for quanti.ed predicates [Das and Dill 2002] have not been demonstrated on most examples (except the AODV model) we consider in this paper....
[...]
...(5) A model of the Ad-hoc On-demand Distance Vector (AODV) routing protocol [C.Perkins et al. 2002]....
[...]
...However, the method simply becomes a heuristic for generating candidate invariants for non-stratified systems, which includes Peterson’s mutual exclusion algorithm [Peterson 1981] and the Ad-hoc On-demand Distance Vector (AODV) [C.Perkins et al. 2002] network protocol....
[...]
...(5) A model of the Ad-hoc On-demand Distance Vector (AODV) routing protocol [Perkins et al. 2002]....
[...]
...However, the method simply becomes a heuristic for generating candidate invariants for nonstrati.ed systems, which includes Peterson s mutual exclusion algorithm [Peterson 1981] and the Ad-hoc On-demand Distance Vector (AODV) [Perkins et al. 2002] network protocol....
[...]
TL;DR: Simulation results show that the MPMP scheme can effectively maximize the gathering of the most valuable information and guarantee the end-to-end transmission delay, and is proposed as a context-aware cross-layer optimized Multi-Path Multi-Priority (MPMP) transmission scheme.
Abstract: The appearance of wireless multimedia sensor networks (WMSNs) requires a new generation transmission paradigm towards intelligent and ubiquitous communication. Video sensors are used in WMSNs to enhance the capability for event description. Multiple routing paths are often used for transmitting video streams. However, not every path found by multi-path routing algorithm is suitable for transmitting video, because a long routing path with a long end-to-end transmission delay may not satisfy the time constraint of the video. Furthermore, each video stream includes two kinds of information: image and audio streams. In different applications, image and audio streams play different roles, and the importance levels are different. Higher priority should be given to the more important stream (either the image stream or the audio stream) to guarantee the using of limited bandwidth and energy in WMSNs. In this paper, we propose a context-aware cross-layer optimized Multi-Path Multi-Priority (MPMP) transmission scheme, in which a Two-Phase geographic Greedy Forwarding (TPGF) multi-path routing protocol is used in network layer to explore the maximum number of node-disjoint routing paths, and a Context-Aware Multi-path Selection algorithm (CAMS) is used in transport layer to choose the maximum number of paths from all found node-disjoint routing paths for maximizing the gathering of the most valuable information to the base station. Simulation results show that the MPMP scheme can effectively maximize the gathering of the most valuable information and guarantee the end-to-end transmission delay.
61 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...However, most of the multi-path routing protocols focus on energy efficiency, load balance, and fault tolerance, and are the extended versions of DSR [8] and AODV [9]....
[...]
Proceedings Article•
01 Jun 2002
TL;DR: A topology approximation (TA) mechanism is proposed to address the problem of mobility and simulations of a typical routing protocol called Ad Hoc On-Demand Distance Vector Routing (AODV) show that the proposed TA mechanism can indeed mimic the dynamically changing graph (mobility) of a MANET.
Abstract: In a mobile ad hoc network (MANET), mobile nodes directly send messages to each other via wireless transmission. A node can send a message to a destination node beyond its transmission range by using other nodes as relay points, and thus a node can function as a router. Typical applications of MANETs include defense systems such as battlefield survivability, and disaster recovery. The research on MANETs originates from part of the Advanced Research Projects Agency (ARPA) project in the 1970s. With the explosive growth of the Internet and mobile communication networks, challenging requirements have been introduced into MANETs and designing routing protocols has become more complex. For a successful application of MANETs, it is very important to ensure that a routing protocol is unambiguous, complete and functionally correct. One approach to ensuring correctness of an existing routing protocol is to create a formal model for the protocol, and analyze the model to determine if indeed the protocol provides the defined service correctly. Colored Petri Nets (CPNs) are a suitable modeling language for this purpose, as it can conveniently express non-determinism, concurrency and different levels of abstraction that are inherent in routing protocols. However, it is not easy to build a CPN model of a MANET because a node can move in and out of its transmission range and thus the MANET's topology (graph) dynamically changes. In this paper, we proposes a topology approximation (TA) mechanism to address this problem of mobility and perform simulations of a typical routing protocol called Ad Hoc On-Demand Distance Vector Routing (AODV). Our simulation results show that our proposed TA mechanism can indeed mimic the dynamically changing graph (mobility) of a MANET.
61 citations
TL;DR: The protocol is augmented by an optimization scheme, adapted from the one proposed for the optimized link state routing protocol (OLSR) in which only selected neighbor nodes propagate control packets to reduce the amount of control overhead.
Abstract: We propose in this paper an optimized, polymorphic, hybrid multicast routing protocol for MANET. This new polymorphic protocol attempts to benefit from the high efficiency of proactive behavior (in terms of quicker response to transmission requests) and the limited network traffic overhead of the reactive behavior, while being power, mobility, and vicinity-density (in terms of number of neighbor nodes per specified area around a mobile node) aware. The proposed protocol is based on the principle of adaptability and multibehavioral modes of operations. It is able to change behavior in different situations in order to improve certain metrics like maximizing battery life, reducing communication delays, improving deliverability, etc. The protocol is augmented by an optimization scheme, adapted from the one proposed for the optimized link state routing protocol (OLSR) in which only selected neighbor nodes propagate control packets to reduce the amount of control overhead. Extensive simulations and comparison to peer protocols demonstrated the effectiveness of the proposed protocol in improving performance and in extending battery power longevity
61 citations
Additional excerpts
...Demand Distance Vector Routing (AODV) [ 23 ], which uses the request-reply method to determine the path to a destination....
[...]
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]....
[...]