scispace - formally typeset
Search or ask a question

Ad hoc On-Demand Distance Vector (AODV) Routing

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.

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI
11 Dec 2006
TL;DR: Simulation results show that HCR conduces better scalability, robustness and adaptability to large scale mobile ad hoc networks compared with some well-known routing protocols, e.g. AODV, DSR, and CBRP.
Abstract: Routing is one of the fundamental but challenging issues in mobile ad hoc networks. During the past several years, a large number of routing protocols have been proposed, which can basically be categorized into three different groups including proactive/table-driven, reactive/on-demand, and hybrid. In this paper, we propose a novel hybrid routing protocol for large scale mobile ad hoc networks, namely HCR (Hybrid Cluster Routing). Here nodes are organized into a hierarchical structure of multi-hop clusters using a stable distributed clustering algorithm. Each cluster is composed of a clusterhead, several gateway nodes, and other ordinary nodes. The clusterhead is responsible for maintaining local membership and global topology information. In HCR, the acquisition of intra-cluster routing information operates in an on-demand fashion and the maintenance of inter-cluster routing information acts in a proactive way. Simulation results show that HCR conduces better scalability, robustness and adaptability to large scale mobile ad hoc networks compared with some well-known routing protocols, e.g. AODV, DSR, and CBRP.

48 citations


Cites background from "Ad hoc On-Demand Distance Vector (A..."

  • ...However, the route discovery is time consuming, thus producing a relatively long route acquisition latency that is undesirable in real-time and interactive communications....

    [...]

Journal ArticleDOI
TL;DR: In this paper, the authors propose the use of a component approach to address embedded control problems and outline a general coponent-based framework to embedded control aid show how it can be instantiated inspecific problems that arise in the control over/of sensor networks.

48 citations

01 Jan 2005
TL;DR: An overview of the recent progress of broadcasting and multicasting in wireless ad hoc networks, and several localized methods that can approximate the minimum energy broadcast tree for non-adjustable power case.
Abstract: Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control and route establishment functionality for a number of unicast and multicast protocols. We present an overview of the recent progress of broadcasting and multicasting in wireless ad hoc networks. We discuss two energy models that could be used for broadcast: one is non-adjustable power and one is adjustable power. If the power consumed at each node is not adjustable, minimizing the total power used by a reliable broadcast tree is equivalent to the minimum connected dominating set problem (MCDS), i.e., minimize the number of nodes that relay the message, since all relaying nodes of a reliable broadcast form a connected dominating set (CDS). If the power consumed at each node is adjustable, we assume that the power consumed by a relay node u is ‖uv‖ , where real number β ∈ [2, 5] depends on transmission environment and v is the farthest neighbor of u in the broadcast tree. For both models, we reviewed several centralized methods that compute broadcast trees consuming the energy within a constant factor of the optimum if the original communication graph is unit disk graph. Since centralized methods are expensive to implement, We further reviewed several localized methods that can approximate the minimum energy broadcast tree for non-adjustable power case. For adjustable power case, no localized methods can approximate the minimum energy broadcast tree and thus review several currently best possible heuristics. Several local improvement methods and activity scheduling of nodes (active, idle, sleep) are also

48 citations


Cites background from "Ad hoc On-Demand Distance Vector (A..."

  • ...Recently, a number of research groups have proposed more efficient broadcasting techniques [8, 9, 10, 11, 12, 13, 14] with various goals such as minimizing the number of retransmissions, minimizing the total power used by all transmitting nodes, minimizing the overall delay of the broadcasting, and so on....

    [...]

Journal ArticleDOI
TL;DR: This paper proposes a simple yet accurate analytical model for the effect of interference on data reception probability, based only on passive measurements and information locally available at the node, and uses this model to design an efficient interference-aware routing protocol that performs as well as probing-based protocols, yet avoids all pitfalls related to active probe measurements.
Abstract: Interference is an inherent characteristic of wireless (multihop) communications. Adding interference-awareness to important control functions, e.g., routing, could significantly enhance the overall network performance. Despite some initial efforts, it is not yet clearly understood how to best capture the effects of interference in routing protocol design. Most existing proposals aim at inferring its effect by actively probing the link. However, active probe measurements impose an overhead and may often misrepresent the link quality due to their interaction with other networking functions. Therefore, in this paper we follow a different approach and: 1) propose a simple yet accurate analytical model for the effect of interference on data reception probability, based only on passive measurements and information locally available at the node; 2) use this model to design an efficient interference-aware routing protocol that performs as well as probing-based protocols, yet avoids all pitfalls related to active probe measurements. To validate our proposal, we have performed experiments in a real testbed, setup in our indoor office environment. We show that the analytical predictions of our interference model exhibit good match with both experimental results as well as more complicated analytical models proposed in related literature. Furthermore, we demonstrate that a simple probeless routing protocol based on our model performs at least as good as well-known probe-based routing protocols in a large set of experiments including both intraflow and interflow interference.

48 citations

Journal Article
TL;DR: A Distributed Evidence-driven Message Exchanging intrusion detection Model (DEMEM) for MANET that allows the distributed detector to cooperatively detect routing attacks with minimal communication overhead and allows detectors to exchange evidences only when necessary.
Abstract: A Mobile Ad Hoc Network (MANET) is a distributed communication platform for mobile wireless nodes. Because of the lack of a centralized monitoring point, intrusion detection systems (IDS) for MANET are usually developed using a distributed architecture where detectors are deployed at each node to cooperatively detect attacks. However, most of these distributed IDS simply assume that each detector exchanges complete information with their peers instead of establishing an efficient message exchanging protocol among detectors. We propose a Distributed Evidence-driven Message Exchanging intrusion detection Model (DEMEM) for MANET that allows the distributed detector to cooperatively detect routing attacks with minimal communication overhead. The framework allows detectors to exchange evidences only when necessary. Under a few practical assumptions, we implement DEMEM to detect routing attacks the Optimal Link State Routing (OLSR) protocol. The example scenarios and performance metrics in the experiment demonstrate that DEMEM can detect routing attacks with low message overhead and delay, no false negatives, and very low false positives under various mobility conditions with message lost. Our ongoing works include implementing DEMEM in AODV, DSR and TBRPF, and a reputation-based cooperative intrusion response model.

48 citations

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]....

    [...]