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: A novel distributed routing protocol which guarantees security, anonymity and high reliability of the established route in a hostile environment, such as ad hoc wireless network, by encrypting routing packet header and abstaining from using unreliable intermediate node is proposed.
98 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...In a single iteration, the initiator adds one node to the path, and receives the list of neighbors of that node....
[...]
22 May 2018
TL;DR: This paper presents the distributed linear solution for stationary agent networks and study its convergence, its robustness to noise, and extensions to mobile scenarios, in which agents, users, and (possibly) anchors are dynamic.
Abstract: Fifth-generation (5G) networks providing much higher bandwidth and faster data rates will allow connecting vast number of stationary and mobile devices, sensors, agents, users, machines, and vehicles, supporting Internet-of-Things (IoT), real-time dynamic networks of mobile things . Positioning and location awareness will become increasingly important, enabling deployment of new services and contributing to significantly improving the overall performance of the 5G system. Many of the currently talked about solutions to positioning in 5G are centralized, mostly requiring direct communication to the access nodes (or anchors, i.e., nodes with known locations), which in turn requires a high density of anchors. But such centralized positioning solutions may become unwieldy as the number of users and devices continues to grow without limit in sight. As an alternative to the centralized solutions, this paper discusses distributed localization in a 5G-enabled IoT environment where many low power devices, users, or agents are to locate themselves without a direct access to anchors. Even though positioning is essentially a nonlinear problem (solving circle equations by trilateration or triangulation), we discuss a cooperative linear distributed iterative solution with only local measurements, local communication, and local computation needed at each agent. Linearity is obtained by reparametrization of the agent location through barycentric coordinate representations based on local neighborhood geometry that may be computed in terms of certain Cayley–Menger determinants involving relative local inter-agent distance measurements. After a brief introduction to the localization problem, and other available distributed solutions primarily based on directly addressing the nonlinear formulation, we present the distributed linear solution for stationary agent networks and study its convergence, its robustness to noise, and extensions to mobile scenarios, in which agents, users, and (possibly) anchors are dynamic.
98 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...There exist two main categories of motion models in the literature; entity mobility models [105], [106] and group mobility models [105], [107], [108]....
[...]
...We consider the random waypoint motion model [106], which can be expressed for node i as follows:...
[...]
...A slightly different entity motion model is the random waypoint mobility model [106], which includes a pause time at each iteration before the changes in speed and/or direction occur....
[...]
30 Sep 2001
TL;DR: Extensive experimental studies clearly indicate that MCNs with the proposed routing protocol are a viable alternative for SCNs, in fact they provide much higher throughput.
Abstract: Multi-hop cellular network (MCN) is an architecture proposed by Lin and Hsu (see INFOCOM 2000. IEEE, 2000) for wireless communication & MCNs combine the benefits of having a fixed infrastructure of base stations and the flexibility of ad-hoc networks. They are capable of achieving much higher throughput than current cellular systems, which can be classified as single-hop cellular networks (SCNs). This work concentrates on MCNs and SCNs using the IEEE 802.11 standard for wireless LANs. We provide a general overview of the architecture and the issues involved in the design of MCNs, in particular the challenges to be met in the design of a routing protocol. We extend the work of Lin and Hsu to enhance the throughput of such networks further. We propose a routing protocol for use in such networks. We conduct extensive experimental studies on the performance of MCNs and SCNs under various load conditions (both TCP and UDP). Then studies clearly indicate that MCNs with the proposed routing protocol are a viable alternative for SCNs, in fact they provide much higher throughput.
98 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...E.2 Route Cache The traffic due to RReq and RRep on the control channel can be greatly reduced by the use of Route Cache (RC) as in other ad-hoc routing protocols like DSR and AODV [5]....
[...]
...The traffic due to RReq and RRep on the control channel can be greatly reduced by the use of Route Cache (RC) as in other ad-hoc routing protocols like DSR and AODV [5]....
[...]
01 Dec 2006
TL;DR: In this article, the authors proposed a distributed algorithm to aid navigation of a user through a geographic area covered by sensors, where sensors sense the level of danger at their locations and use this information to find a safe path for the user through the sensor field.
Abstract: We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon flooding the whole network with packets to find an optimal safe path. To reduce the communication expense, we introduce the concept of a skeleton graph which is a sparse subset of the true sensor network communication graph. Using skeleton graphs we show that it is possible to find approximate safe paths with much lower communication cost. We give tight theoretical guarantees on the quality of our approximation and by simulation, show the effectiveness of our algorithms in realistic sensor network situations.
97 citations
Posted Content•
TL;DR: Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.
97 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]....
[...]