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
26 Apr 2004
TL;DR: Analysis and experimental results show a routing protocol with the consideration of the incentives of individual nodes stimulates cooperation and improves network lifetime without significantly diminishing the performance of the whole network.
Abstract: Summary form only given. In wireless mobile ad hoc networks (MANET), energy is a scarce resource. Though cooperation is the basis of network services, due to the limited energy reserve of each node, there is no guarantee any given protocols would be followed by nodes managed by different authorities. Instead of treating the selfish nodes as a security concern and trying to eliminate them, we propose a novel way to encourage cooperative works - rewarding service providers according to their contributions. Nodes in a MANET can form coalitions to reduce aggregate transmission power on each hop along a route. The payment of each node in a coalition is determined by using Shapley Value, a well-known concept in game theory for allocating payoff for each member in a cooperative coalition. We present the contribution reward routing protocol with Shapley Value (CAP-SV). It achieves the objective of truthfulness. The performance of CAP-SV is studied by simulations using ns-2. Analysis and experimental results show a routing protocol with the consideration of the incentives of individual nodes stimulates cooperation and improves network lifetime without significantly diminishing the performance of the whole network.
64 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...The process described above is similar to any other distance vector protocols, such as AODV [26]....
[...]
...We also simulated AODV [26] in the same scenarios....
[...]
...We implement CAP-SV in ns-2 network simulator [2] and evaluate its performance with AODV[26] as a reference....
[...]
01 Oct 2006
TL;DR: The heterogeneous connected set covers (HCSC) problem is introduced and it is shown that HCSC is NP-complete and two algorithms for solving this problem are proposed, an integer programming approach and a distributed and localized protocol.
Abstract: This paper considers a heterogeneous wireless sensor network that consists of several resource-rich supernodes used for data relaying and a large number of energy constrained wireless sensor nodes. Sensor nodes are deployed randomly to monitor a number of targets. Since targets are redundantly covered by more sensors, we organize the sensors in set covers that are activated successively to conserve energy. In this paper we introduce the Heterogeneous Connected Set Covers (HCSC) problem that has the objective to find a maximum number of set covers such that each set cover monitors all targets and each active sensor is connected to at least one supernode. A sensor can participate in multiple set covers, but the total energy spent in all sets is constrained by the battery capacity. In this paper we show that HCSC is NP-complete and we propose two algorithms for solving this problem, an Integer Programming approach and a distributed and localized protocol. Simulation results are presented to evaluate these solutions.
64 citations
Dissertation•
01 Jan 2004TL;DR: This dissertation summarizes all the aforementioned methodologies and corresponding applications the authors developed concerning MANET routing protocols and shows that reactive protocols may only be suitable for MANETs with small number of traffic loads and small link connectivity change rates.
Abstract: A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead of static network infrastructure to provide network connectivity. MANETs have applications in rapidly deployed and dynamic military and civilian systems. The network topology in a MANET usually changes with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing protocols may not be suitable for MANETs. For example, some assumptions used by these protocols are not valid in MANETs or some protocols cannot efficiently handle topology changes.
Researchers are designing new MANET routing protocols and comparing and improving existing MANET routing protocols before any routing protocols are standardized using simulations. However, the simulation results from different research groups are not consistent with each other. This is because of a lack of consistency in MANET routing protocol models and application environments, including networking and user traffic profiles. Therefore, the simulation scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is difficult for one to choose a proper routing protocol for a given MANET application.
According to the aforementioned issues, my Ph.D. research focuses on MANET routing protocols. Specifically, my contributions include the characterization of different routing protocols using a novel systematic relay node set (RNS) framework, design of a new routing protocol for MANETs, a study of node mobility, including a quantitative study of link lifetime in a MANET and an adaptive interval scheme based on a novel neighbor stability criterion, improvements of a widely-used network simulator and corresponding protocol implementations, design and development of a novel emulation test bed, evaluation of MANET routing protocols through simulations, verification of our routing protocol using emulation, and development of guidelines for one to choose proper MANET routing protocols for particular MANET applications.
Our study shows that reactive protocols do not always have low control overhead, as people tend to think. The control overhead for reactive protocols is more sensitive to the traffic load, in terms of the number of traffic flows, and mobility, in terms of link connectivity change rates, than other protocols. Therefore, reactive protocols may only be suitable for MANETs with small number of traffic loads and small link connectivity change rates. We also demonstrated that it is feasible to maintain full network topology in a MANET with low control overhead. This dissertation summarizes all the aforementioned methodologies and corresponding applications we developed concerning MANET routing protocols.
64 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...The Ad hoc On-demand Distance Vector (AODV) routing protocol [50] is a reactive MANET routing protocol....
[...]
...The algorithm avoids the Bellman-Ford “count to infinity” problem [50]....
[...]
...Therefore, it offers quick convergence when the ad hoc network topology changes which, typically, occurs when a node moves in the network [50]....
[...]
...For example, a MANET routing protocol known as AODV holds outgoing user packets in a buffer for up to a certain maximum holding time before the packet is sent or dropped [50]....
[...]
...describe an effort to reduce the range of the RNS built when a route request is sent [50]....
[...]
03 Jan 2005
TL;DR: This paper presents the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks and shows that the stated security goals are met using the BAN logic formalism.
Abstract: In this paper we present the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks. We also present a number of similar protocols and compare the different approaches. After a detailed description of SDSR, we show that the stated security goals are met using the BAN logic formalism.
64 citations
21 Jun 2009
TL;DR: This paper proposes an anomaly-based intrusion detection system that uses a combination of chi-square test & control chart to first detect intrusion and then identify an intruder, and shows that the algorithm performs well at an affordable processing overhead over the range of scenarios tested.
Abstract: Mobile ad-hoc networks (MANETs) are well known to be vulnerable to various attacks, due to features such as lack of centralized control, dynamic topology, limited physical security and energy constrained operations. In this paper we focus on preventing denial-of-service (DoS) attacks. As an example, we consider intruders that can cause DoS by exploiting the route discovery procedure of reactive routing protocols. We show the unsuitability of tools such as control chart, used in statistical process control (SPC), to detect DoS and propose an anomaly-based intrusion detection system that uses a combination of chi-square test & control chart to first detect intrusion and then identify an intruder. When the intruder is isolated from the network we show reduced overhead and increased throughput. Simulation results show that our algorithm performs well at an affordable processing overhead over the range of scenarios tested.
63 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]....
[...]