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: This article surveys this paradigm shift for routing in WSNs and follows a rather chronological organization within the given protocol taxonomy, sheds some light on the design choices of emerging IETF ROLL protocols and provides design parameters of interest to the WSN engineer, essentially enabling the design and implementation of more reliable and efficient WSN solutions.
Abstract: In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such routing path is known to significantly increase the performance of said networks. This holds particularly true for wireless sensor networks (WSNs) consisting of a large amount of miniaturized battery-powered wireless networked sensors required to operate for years with no human intervention. There has hence been a growing interest on understanding and optimizing WSN routing and networking protocols in recent years, where the limited and constrained resources have driven research towards primarily reducing energy consumption, memory requirements and complexity of routing functionalities. To this end, early flooding-based and hierarchical protocols have migrated within the past decade to geographic and self-organizing coordinate-based routing solutions. The former have been brought to standardization through the Internet Engineering Task Force (IETF) Mobile Ad-hoc Networks (MANET) working group; the latter are currently finding their way into standardization through the IETF Routing Over Low power and Lossy networks (ROLL) working group. This article thus surveys this paradigm shift for routing in WSNs and, unlike previous milestone surveys, follows a rather chronological organization within the given protocol taxonomy. For each protocol family, we provide a didactic presentation of the basic concept, a discussion on the enhancements and variants on that concept, and a detailed description of the latest state-of-the-art protocols of that family. We believe that this organization sheds some light on the design choices of emerging IETF ROLL protocols and also provides design parameters of interest to the WSN engineer, essentially enabling the design and implementation of more reliable and efficient WSN solutions.
181 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...In AODV, a route request builds a route to a single node, i.e. at least as many route requests as the number of nodes in the network are needed....
[...]
...The most popular MANET protocols are Dynamic Source Routing (DSR) [28] and Adhoc On-demand Distance Vector (AODV) [29]....
[...]
...gradients 1999 GFG [46] DSR [28] directed diffusion [27] 2000 GPSR [48] TEEN [34] 2001 GBR [73] APTEEN [35] 2002 LEACH [24] AODV [29] OLSR [23] Niculescu et al....
[...]
...The IETF MANET working group standardized protocols which flood requests inside a network to find route on-demand (DSR [28], AODV [29], DYMO [30]) and which optimize the...
[...]
...Dynamic Mobile On-Demand routing (DYMO) [30] uses the same principle as AODV to construct shortest length paths....
[...]
17 Nov 2002
TL;DR: Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.
Abstract: A novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper. The proposed hybrid protocol reduces route discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the one side the proactive routing protocols in MANETs like Destination Sequenced Distance Vector (DSDV) require to know, the topology of the entire network. Hence they are not suitable for highly dynamic networks such as MANETs, since the topology update information needs to be propagated frequently throughout the network. These frequent broadcasts limit the available network capacity for actual data communication. On the other hand, on-demand, reactive routing schemes like AODV and Dynamic Source Routing (DSR), require the actual transmission of the data to be delayed until the route is discovered. Due to this long delay a pure reactive routing protocol may not be applicable for real-time data and multimedia communication. Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.
181 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...…Singapore 119260 Abstract-- A novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper....
[...]
TL;DR: This paper formalizes the location privacy issues in sensor networks under this strong adversary model and computes a lower bound on the communication overhead needed for achieving a given level of location privacy, and proposes two techniques to provide location privacy to monitored objects and data sinks.
Abstract: While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed Such contextual information can be exploited by an adversary to derive sensitive information such as the locations of monitored objects and data sinks in the field Attacks on these components can significantly undermine any network application Existing techniques defend the leakage of location information from a limited adversary who can only observe network traffic in a small region However, a stronger adversary, the global eavesdropper, is realistic and can defeat these existing techniques This paper first formalizes the location privacy issues in sensor networks under this strong adversary model and computes a lower bound on the communication overhead needed for achieving a given level of location privacy The paper then proposes two techniques to provide location privacy to monitored objects (source-location privacy)-periodic collection and source simulation-and two techniques to provide location privacy to data sinks (sink-location privacy)-sink simulation and backbone flooding These techniques provide trade-offs between privacy, communication cost, and latency Through analysis and simulation, we demonstrate that the proposed techniques are efficient and effective for source and sink-location privacy in sensor networks
179 citations
01 Jan 2008
TL;DR: A simulation-based study of the impacts of different types of attacks on mesh-based multicast in mobile ad hoc networks (MANETs) and how the number of attackers and their positions affect the performance metrics of a multicast session.
Abstract: We present a simulation-based study of the impacts of different types of attacks on mesh-based multicast in mobile ad hoc networks (MANETs). We consider the most common types of attacks, namely rushing attack, blackhole attack, neighbor attack and jellyfish attack. Specifically, we study how the number of attackers and their positions affect the performance metrics of a multicast session such as packet delivery ratio, throughput, end-to-end delay, and delay jitter. We also examine rushing attackers' success rates of invading into the routing mesh when the number of attackers and their positions vary. The results enable us to suggest measures to minimize the impacts of the above types of attacks on multicast in MANETs.
177 citations
09 Jun 2002
TL;DR: The results indicate that the marginal benefit of using a high-overhead routing protocol to utilize unidirectional links is questionable and all three techniques for AODV improve performance by avoiding unid Directional links the ReversePathSearch technique being the most effective.
Abstract: We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper we evaluate the benefit from utilizing unidirectional links for routing as opposed to using only bidirectional links. Our evaluations are based on three transmit power assignment models that reflect some realistic network scenarios with unidirectional links. Our results indicate that the marginal benefit of using a high-overhead routing protocol to utilize unidirectional links is questionable.Most common routing protocols however simply assume that all network links are bidirectional and thus may need additional protocol actions to remove unidirectional links from route computations. In the second part of the paper we investigate this issue using a well known on-demand routing protocol Ad hoc On-demand Distance Vector (AODV) as a case study. We study the performance of three techniques for AODV for efficient operation in presence of unidirectional links viz. BlackListing Hello and ReversePathSearch. While BlackListing and Hello techniques explicitly eliminate unidirectional links the ReversePathSearch technique exploits the greater network connectivity offered by the existence of multiple paths between nodes. Performance results using ns-2 simulations under varying number of unidirectional links and node speeds show that all three techniques improve performance by avoiding unidirectional links the ReversePathSearch technique being the most effective.
177 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...Majority of the protocols developed for multihop wireless networks assume bidirectional links (e.g., [17], DSDV [27], AODV [ 28 ],...
[...]
...We investigate the importance of such mechanisms using a well-known on-demand routing protocol called Ad hoc On-demand Distance Vector (AODV) [29, 28 ]....
[...]
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]....
[...]