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: The ASCENT algorithm is motivated and described and it is shown that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity.
Abstract: Advances in microsensor and radio technology enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low-per node cost allows these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks coordinate to perform the distributed sensing and actuation tasks. Moreover, as described in this paper, the nodes can also coordinate to exploit the redundancy provided by high density so as to extend overall system lifetime. The large number of nodes deployed in this systems preclude manual configuration, and the environmental dynamics precludes design-time preconfiguration. Therefore, nodes have to self-configure to establish a topology that provides communication under stringent energy constraints. ASCENT builds on the notion that, as density increases, only a subset of the nodes is necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation, and experimental measurements. We show that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity.
452Â citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...Mobile ad-hoc networks [21], [25], [ 26 ] and directed diffusion [19] adaptively configure the routing or data dissemination paths, but they do not adapt the basic topology....
[...]
01 Mar 2007
TL;DR: This work introduces a tool MOVE, a tool that allows users to rapidly generate realistic mobility models for VANET simulations and shows that the simulation results obtained when nodes moving according to a realistic mobility model is significantly different from that of the commonly used random waypoint model.
Abstract: One emerging, new type of ad-hoc network is the vehicular ad-hoc network (VANET), 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 conclusions drawn from simulation experiments will carry through to real deployments. In this work, we 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 and compare ad-hoc routing performance for vehicular nodes using MOVE to that using the random waypoint model. We show that the simulation results obtained when nodes moving according to a realistic mobility model is significantly different from that of the commonly used random waypoint model.
448Â citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...In addition, the packet delivery ratios of AODV when using MOVE mobility models are lower than when using Random Waypoint model and have larger variations....
[...]
...Figure 10 shows the packet delivery ratio of AODV with different number of traffic sources....
[...]
...We compare the performance of AODV [13] when used with the random waypoint model to that using the MOVE mobility model....
[...]
TL;DR: The characteristic features of ad hoc networks are reviewed, alternative approaches based on the adversarial network model are discussed, and two basic problem domains are focused on: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing.
Abstract: An ad hoc wireless network, or simply an ad hoc network, consists of a collection of geographically distributed nodes that communicate with one other over a wireless medium. An ad hoc network differs from cellular networks in that there is no wired infrastructure and the communication capabilities of the network are limited by the battery power of the network nodes. One of the original motivations for ad hoc networks is found in military applications. A classic example of ad hoc networking is network of war fighters and their mobile platforms in battlefields. Indeed, a wealth of early research in the area involved the development of packet-radio networks (PRNs) and survivable radio networks [16]. While military applications still dominate the research needs in ad hoc networking, the recent rapid advent of mobile telephony and plethora of personal digital assistants has brought to the fore a number of potential commercial applications of ad hoc networks. Examples are disaster relief, conferencing, home networking, sensor networks, personal area networks, and embedded computing applications [37].The lack of a fixed infrastructure in ad hoc networks implies that any computation on the network needs to be carried out in a decentralized manner. Thus, many of the important problems in ad hoc networking can be formulated as problems in distributed computing. However, there are certain characteristics of ad hoc networks that makes this study somewhat different than traditional work in distributed computing. In this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. This article is not intended to be a comprehensive survey on ad hoc networking. The choice of the problems discussed in this article are somewhat biased by the research interests of the author.The remainder of this article is organized as follows. In Section 2, we describe various aspects relevant to modeling ad hoc networks. In Section 3, we discuss topology control. Since the nodes of an ad hoc network are often associated with points in 2-dimensional space, topology control is closely tied to computational geometry; we will briefly review this relationship and extant work in the area. In Section 4, we discuss routing protocols for ad hoc networks. After a brief overview of the many protocols that have been proposed, we discuss alternative approaches based on the adversarial network model.
447Â citations
Patent•
15 Dec 2005
TL;DR: In this article, a wireless network is considered, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client, each client and server includes programs for determining optimum routes between them, and each client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such an optimal route.
Abstract: A wireless network, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client. Each client and server includes programs for determining optimum routes between them. The client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such a new optimal route.
442Â citations
TL;DR: Simulation results indicate the benefits of the proposed routing strategy in terms of increasing link duration, reducing the number of link-breakage events and increasing the end-to-end throughput.
Abstract: There are numerous research challenges that need to be addressed until a wide deployment of vehicular ad hoc networks (VANETs) becomes possible. One of the critical issues consists of the design of scalable routing algorithms that are robust to frequent path disruptions caused by vehicles' mobility. This paper argues the use of information on vehicles' movement information (e.g., position, direction, speed, and digital mapping of roads) to predict a possible link-breakage event prior to its occurrence. Vehicles are grouped according to their velocity vectors. This kind of grouping ensures that vehicles, belonging to the same group, are more likely to establish stable single and multihop paths as they are moving together. Setting up routes that involve only vehicles from the same group guarantees a high level of stable communication in VANETs. The scheme presented in this paper also reduces the overall traffic in highly mobile VANET networks. The frequency of flood requests is reduced by elongating the link duration of the selected paths. To prevent broadcast storms that may be intrigued during path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as ldquobest packetsrdquo in this paper. The performance of the scheme is evaluated through computer simulations. Simulation results indicate the benefits of the proposed routing strategy in terms of increasing link duration, reducing the number of link-breakage events and increasing the end-to-end throughput.
438Â citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Notable examples are ad hoc on-demand distance vector (AODV) [13] and dynamic source routing (DSR) [14]....
[...]
...The two figures show the higher stability of ROMSGP compared to that of ABR and a modified version of DSR (M-DSR) which adapts the data retrieval concept of finding nodes that can provide the requested data and uses path distance as a cost metric to find the best path (other similar reactive protocols which do not take mobility into consideration such as AODV would yield similar results to DSR) for path selection....
[...]
...ples are ad hoc on-demand distance vector (AODV) [13] and dynamic source routing (DSR) [14]....
[...]
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]....
[...]