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
12 May 2004
TL;DR: A new technique to formally verify ad-hoc network routing protocols by the use of a well-known model-checker: SPIN is presented.
Abstract: Tests and simulations are the only verification techniques used for ad-hoc network routing protocols. Although these techniques give us an excellent overview of the protocol behavior, some undesirable aspects of the protocol could still be undiscovered. Therefore formal verification is needed. This paper presents a new technique to formally verify such protocols by the use of a well-known model-checker: SPIN. As an example, a formal verification of the wireless adaptive routing protocol (W.A.R.P) has been performed.
83Â citations
TL;DR: A simple scheme based on statistical analysis of multi-path (called SAM) is proposed to detect such attacks and to identify malicious nodes and results demonstrate that SAM successfully detects wormhole attacks and locates the malicious nodes in networks with different topologies and with different node transmission range.
83Â citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...When single-path on-demand routing protocol such as AODV (Perkins et al., 2003) is used in highly dynamic wireless ad hoc networks, a new route discovery is needed in response to every route break....
[...]
...This mechanism can detect replay attacks and sort out wormhole attacks in AODV....
[...]
...Security enhancement of single-path routing protocols have also been proposed recently, for example, SEAD (Hu et al., 2002a), SRP (Papadimitratos and Haas, 2002), Ariadne (Hu et al., 2002b), ARAN (Sanzgiri et al., 2002), and secure AODV (Zapata, 2002)....
[...]
...The results show that multi-path routing is vulnerable to wormhole attacks....
[...]
01 Oct 2008
TL;DR: This work introduces a tool MOVE, a tool that allows users to rapidly generate realistic mobility models for VANET simulations and evaluates the effects of details of mobility models in three case studies of VANet simulations to show that selecting sufficient level of details in the simulation is critical forVANET protocol design.
Abstract: Vehicular ad-hoc network (VANET) is surging in popularity, in which vehicles constitute the mobile nodes in the network. Due to the prohibitive cost of deploying and implementing such a system in real world, most research in VANET relies on simulations for evaluation. A key component for VANET simulations is a realistic vehicular mobility model that ensures that conclusions drawn from simulation experiments will carry through to real deployments. In this work, we first introduce a tool MOVE that allows users to rapidly generate realistic mobility models for VANET simulations. MOVE is built on top of an open source micro-traffic simulator SUMO. The output of MOVE is a realistic mobility model and can be immediately used by popular network simulators such as ns-2 and qualnet. We evaluate the effects of details of mobility models in three case studies of VANET simulations (specifically, the existence of traffic lights, driver route choice and car overtaking behavior) and show that selecting sufficient level of details in the simulation is critical for VANET protocol design.
83Â citations
01 Aug 2008
TL;DR: A novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR), which aims at minimizing complexity in the nodes at the expenses of the optimality of the solution.
Abstract: This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known Ad hoc On Demand Distance Vector (AODV) algorithm. The differences and the similarities of the two algorithms have been highlighted. Results obtained by a theoretical analysis and a simulation campaign show that DAR allows obtaining some important advantages that makes it a valuable candidate to operate in ad hoc networks and the same method helps in the selection of the algorithm parameters. Since the approach aims at minimizing complexity in the nodes at the expenses of the optimality of the solution, it results to be particularly suitable in environments where fast communication establishment and minimum signalling overhead are requested. These requirements are typical of ad hoc networks with critical connectivity, as described in the paper. Thus the performance of the proposed algorithm are shown in ad hoc networks with critical connectivity and compared to some existing ad hoc routing algorithms.
83Â citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Keywords: Ad hoc networks; Routing protocol; Ant routing; Critical connectivity...
[...]
07 Jun 2004
TL;DR: A policy-based mobile ad hoc network management system that provides the capability to express networking requirements in the form of policies at a high level and have them automatically realized in the network by intelligent agents.
Abstract: Ad hoc networking is the basis of the future military network-centric warfare architecture. Such networks are highly dynamic in nature, as mobile ad hoc networks are formed over wireless links that are susceptible to failure. Strict requirements on security and reliability combined with the dynamic nature of the network provide a strong motivation for self-forming, self-configuring, and self-healing capabilities in the network. This paper describes a policy-based mobile ad hoc network management system that addresses these needs. The system provides the capability to express networking requirements in the form of policies at a high level and have them automatically realized in the network by intelligent agents. Our system provides the following capabilities: flexible monitoring and reporting that enables collection of management information from network elements at configurable intervals; automated configuration and reconfiguration of network elements based on reported network status; user-definable aggregation and filtering of monitored management information at the source of the data so as to reduce management station processing and network transmission overhead.
83Â citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...They are implemented and enforced by Policy Agents, and stored in a Policy Repository implemented as a MySQL database server....
[...]
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]....
[...]