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
19 Sep 2003
TL;DR: This paper presents the first experimental testbed evaluation of energy-aware topology control integrated with energy-saving synchronization and demonstrates an 82-92% reduction in energy consumption and a small number of wall-powered nodes can significantly improve the lifetime of a battery-powered network.
Abstract: While multi-hop networks consisting of 100s or 1000s of inexpensive embedded sensors are emerging as a means of mining data from the environment, inadequate network lifetime remains a major impediment to real-world deployment. This paper describes several applications deployed throughout our building that monitor conference room occupancy and environmental statistics and provide access to room reservation status. Because it is often infeasible to locate sensors and display devices near power outlets, we designed two protocols that allow energy conservation in a large class of sensor network applications. The first protocol, Relay Organization (ReOrg), is a topology control protocol which systematically shifts the network's routing burden to energy-rich nodes, exploiting heterogeneity. The second protocol, Relay Synchronization (ReSync), is a MAC protocol that extends network lifetime by allowing nodes to sleep most of the time, yet wake to receive packets. When combined, ReOrg and ReSync lower the duty cycle of the nodes, extending network lifetime. To our knowledge, this paper presents the first experimental testbed evaluation of energy-aware topology control integrated with energy-saving synchronization. Using a 54-node testbed, we demonstrate an 82-92% reduction in energy consumption, depending on traffic load. By rotating the burden of routing, our protocols can extend network lifetime by 5-10 times. Finally, we demonstrate that a small number of wall-powered nodes can significantly improve the lifetime of a battery-powered network.
65 citations
01 Jan 2003
TL;DR: Simulation results show that passive clustering can reduce redundant flooding by up to 70% with negligible extra protocol overhead, and it is shown that passive clusters can be applied to several reactive, on-demand routing protocols with substantial performance gains.
Abstract: In this paper, we propose a new flooding mechanism based on passive, on-demand clustering This mechanism reduces flooding overhead without loss of network performance Passive clustering dynamically partitions the network in clusters interconnected by gateways Passive clustering is an on demand protocol It executes only when there is user data traffic; it exploits data packets for cluster formation Passive clustering offers several advantages compared with “active” clustering and route aggregation techniques In particular, it reduces node power consumption by eliminating the periodic, background control packet exchange Simulation results show that passive clustering can reduce redundant flooding by up to 70% with negligible extra protocol overhead Moreover, we show that passive clustering can be applied to several reactive, on-demand routing protocols (eg, AODV, DSR and ODMRP) with substantial performance gains
65 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...A cluster head (CH) declaration A node in INITIAL state changes its state to CH READY (a candidate cluster head) when a packet arrives from another node that is not a cluster head....
[...]
...Note that a candidate gateway node can become an ordinary node any time with the detection of enough gateways....
[...]
07 Nov 2002
TL;DR: Simulation results show that the ant-AODV hybrid technique proposed is able to achieve reduced end-to-end delay as compared to conventional ant-based and AODV routing protocols.
Abstract: This paper proposes a novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of ad hoc on-demand distance vector (AODV) routing protocol with a distributed topology discovery mechanism using ant like mobile agents. AODV requires the actual communication to be delayed until the route is determined (found). This may not be suitable for real time data and multimedia communication applications. Ant-AODV provides high connectivity, reducing the amount of route discoveries before starting new connections. This eliminates the delay before starting actual communication for most new connections making ant-AODV routing protocol ideal for real time communication in highly dynamic networks such as MANETs. Simulation results show that the ant-AODV hybrid technique proposed is able to achieve reduced end-to-end delay as compared to conventional ant-based and AODV routing protocols. In addition, ant-AODV also provides high connectivity.
65 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...This paper tries to overcome these shortcomings of ant routing and AODV [ 1 ] by combining them to develop a hybrid routing scheme....
[...]
...In AODV [ 1 ], if a node desires to send a message to a destination node for which it does not have a valid route to, it initiates a route discovery to locate the destination node....
[...]
25 Mar 2005
TL;DR: This paper presents EARA-QoS, a improved version of swarm-intelligence inspired ad hoc routing algorithm EARA introduced in (Z. Liu et al., 2004), which uses the principle of swarm intelligence to evolutionally maintain routing information.
Abstract: This paper presents EARA-QoS, a improved version of swarm-intelligence inspired ad hoc routing algorithm EARA introduced in (Z. Liu et al., 2004). In this algorithm, we use the principle of swarm intelligence to evolutionally maintain routing information. The biological concept of stigmergy is used to reduce the amount of control traffic. A light-weight QoS scheme is proposed to provide service-classified traffic control. The simulation results show that this novel routing algorithm performs well in a variety of network conditions.
65 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...The QoS version of AODV (QoS-AODV) [23], the Core-Extraction Distributed Ad Hoc Routing (CEDAR) protocol [10], the Multimedia Support for Mobile Wireless Networks (MMWN) protocol [11], and the ticket-based protocols [24] are examples of QoS routing algorithms proposed for MANETs....
[...]
TL;DR: This paper develops a formal branch-and-bound framework and exploits the so-called reformulation-linearization technique (RLT) in the solution procedure and shows that this solution procedure is able to produce a set of routes whose objective value is within (1 - e) of the optimum.
Abstract: Traditionally, routing is considered solely as a network layer problem and has been decoupled from application layer objectives. Although such an approach offers simplicity in the design of the protocol stack, it does not offer good performance for certain applications such as video. In this paper, we explore the problem of how to perform routing with the objective of optimizing application layer performance. Specifically, we consider how to perform multipath routing for multiple description (MD) video in a multi-hop wireless network. We formulate this problem into an optimization problem with application performance metric as the objective function and routing and link layer considerations as constraints. We develop a formal branch-and-bound framework and exploit the so-called reformulation-linearization technique (RLT) in the solution procedure. We show that this solution procedure is able to produce a set of routes whose objective value is within (1 - e) of the optimum. We use simulation results to substantiate the efficacy of the solution procedure and compare the performance with that under non-cross-layer approach.
65 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Existing routing protocols for such networks (e.g., OLSR [5], DSR [8], AODV [ 14 ]) mainly focus on network layer connectivity problem and do not have explicit consideration for video application requirements....
[...]
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]....
[...]