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 2008
TL;DR: It is shown that a cubic routing stretch constitutes a lower bound for any local memoryless routing algorithm, and several randomized geographic routing algorithms which work well for 3D network topologies are proposed and analyzed.
Abstract: We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing decision solely on its local view of the network, nodes do not store any message state, and the message itself can only carry information about O(1) nodes. In geographic routing schemes, each network node is assumed to know the coordinates of itself and all adjacent nodes, and each message carries the coordinates of its target. Whereas many of the aspects of geographic routing have already been solved for 2D networks, little is known about higher-dimensional networks. It has been shown only recently that there is in fact no local memoryless routing algorithm for 3D networks that delivers messages deterministically. In this paper, we show that a cubic routing stretch constitutes a lower bound for any local memoryless routing algorithm, and propose and analyze several randomized geographic routing algorithms which work well for 3D network topologies. For unit ball graphs, we present a technique to locally capture the surface of holes in the network, which leads to 3D routing algorithms similar to the greedy-face-greedy approach for 2D networks.
125Â citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Reactive routing schemes determine the route only on demand using flooding [28] to find a path to the destination....
[...]
04 Apr 2005
TL;DR: Flood attack prevention (FAP), a generic defense against the ad hoc flooding attack in mobile ad hoc networks, is developed, composed of neighbor suppression and path cutoff.
Abstract: Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DOS) attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called ad hoc flooding attack, can result in denial of service when used against on-demand routing protocols for mobile ad hoc networks, such as AODV, DSR. The intruder broadcasts mass Route Request packets or sends a lot of attacking DATA packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed ad hoc flooding attack, we develop flooding attack prevention (FAP), a generic defense against the ad hoc flooding attack in mobile ad hoc networks. The FAP is composed of neighbor suppression and path cutoff. When the intruder broadcasts exceeding packets of route request, the immediate neighbors of the intruder observe a high rate of route request and then they lower the corresponding priority according to the rate of incoming queries. Moreover, not serviced low priority queries are eventually discarded. When the intruder sends many attacking DATA packets to the victim node, the node may cut off the path and does not set up a path with the intruder any more. Mobile ad hoc networks can prevent the ad hoc flooding attack by FAP with little overhead.
125Â citations
01 Jan 2008
TL;DR: The studies have shown that reactive protocols perform better than proactive protocols, and DSR has performed well for the performance parameters namely delivery ratio and routing overload while AODV performed better in terms of average delay.
Abstract: Summary The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc Ondemand Distance Vector (AODV), Destination-Sequenced Distance-Vector Routing protocol (DSDV), Dynamic Source Routing Protocol (DSR), and Optimum Link State Routing (OLSR). Despite the popularity of those protocols, research efforts have not focused much in evaluating their performance when applied to variable bit rate (VBR). In this paper we present our observations regarding the performance comparison of the above protocols for VBR in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. Our studies have shown that reactive protocols perform better than proactive protocols. Further DSR has performed well for the performance parameters namely delivery ratio and routing overload while AODV performed better in terms of average delay.
125Â citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...It reduces number of broadcast by creating routes on demand basis, as against DSDV that maintains mutes to each known destination [4] [5] [6] [ 20 ]....
[...]
TL;DR: A unified formal model of the bio-inspired multimodular approaches applied to VANET routing is proposed and is highlighted to highlight main future research directions in this area.
Abstract: Vehicular Ad hoc NETworks (VANETs) play a key role in the design and development of Intelligent Transportation Systems (ITS) that aim to improve road safety and transportation productivity VANETs cover vehicle-to-vehicle and vehicle-to-roadside communications One of the most important challenges of this type of network is the timely and reliable dissemination of messages among vehicular nodes that enable drivers to take appropriate decisions to improve road safety In the past decade, many routing protocols for VANETs that can support reliability and safety requirements have been proposed These protocols suffer from several limitations, including complexity, lack of scalability to large scale networks, routing overheads, etc To address these limitations, various bio-inspired approaches have been proposed to route packets among vehicular nodes in an optimized manner We survey recent proposed bio-inspired routing algorithms for the VANET environment In particular, we identify the key features, strengths, and weaknesses of these algorithms and compare them by using various criteria Moreover, we propose a unified formal model of the bio-inspired multimodular approaches applied to VANET routing We highlight main future research directions in this area
125Â citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...pPSO was conceived to improve the QoS parameters of the Ad hoc On-demand Distance Vector routing (AODV) protocol [35] such as packet delivery ratio, normalized routing load, and end-to-end delays....
[...]
...ing (AODV) [35] and Dynamic Source Routing (DSR) [68]...
[...]
...SIMPLE was shown to yield better scalability and robustness against node failures when compared with Ad hoc On-demand Distance Vector routing (AODV) [35], Dynamic Source Routing (DSR) [68], and a traditional routing algorithm called Max-min Remaining Energy Protocol (MREP) [69]....
[...]
01 Nov 2010
TL;DR: Simulation results shows the CBDRP can solve the problem of link stability in VANET, realizing reliable and rapid data transmission.
Abstract: Vehicular Ad-hoc Network (VANET) is a new application of Mobile Ad-hoc Network (MANET) in the field of Inter-vehicle communication. As the high mobility of vehicles, some traditional MANET routing protocols may not fit the VANET. In this paper, we propose a cluster-based directional routing protocol (CBDRP) for highway scenarios, in which the header of a cluster selects another header according to the moving direction of vehicle to forward packets. Simulation results shows the CBDRP can solve the problem of link stability in VANET, realizing reliable and rapid data transmission.
125Â 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]....
[...]