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
01 Jun 2003
TL;DR: This paper presents a new reliable transport layer protocol for ad hoc networks called ATP (ad hoc transport protocol), and shows through ns2-based simulations that ATP outperforms default TCP as well as TCP-ELFN and ATCP.
Abstract: Existing works have approached the problem of reliable transport in ad-hoc networks by proposing mechanisms to improve TCP's performance over such networks. In this paper we show through detailed arguments and simulations that several of the design elements in TCP are fundamentally inappropriate for the unique characteristics of ad-hoc networks. Given that ad hoc networks are typically stand-alone, we approach the problem of reliable transport from the perspective that it is justifiable to develop an entirely new transport protocol that is not a variant of TCP. Towards this end, we present a new reliable transport layer protocol for ad-hoc networks called ATP (ad-hoc transport protocol). We show through ns2 based simulations that ATP outperforms both default TCP and TCP-ELFN.
356 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Most routing protocols designed for ad-hoc networks [1, 2] rely on such MAC feedback to trigger route-failure notification to the source....
[...]
...At the network layer, numerous routing protocols such as dynamic source routing (DSR) [1], adhoc on-demand distance vector (AODV) routing [2], etc....
[...]
25 Sep 2006
TL;DR: In this paper, architectures for two-dimensional and three-dimensional underwater sensor networks are discussed and open research issues are discussed.
Abstract: In this paper, architectures for two-dimensional and three-dimensional underwater sensor networks are discussed. A detailed overview on the current solutions for medium access control, network, and transport layer protocols are given and open research issues are discussed.
356 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Reactive protocols (e.g., AODV [ 21 ], DSR [13]) are more appropriate for dynamic environments but incur a higher latency and still require source-initiated flooding of control packets to establish paths....
[...]
TL;DR: This article considers the term ICNs as Delay/Disruption Tolerant Networks (DTNs) for the purpose of generalization, since DTNs have been envisioned for different applications with a large number of proposed routing algorithms.
Abstract: The introduction of intelligent devices with short range wireless communication techniques has motivated the development of Mobile Ad hoc NETworks (MANETs) during the last few years. However, traditional end-to-end based routing algorithms designed for MANETs are not much robust in the challenged networks suffering from frequent disruption, sparse network density and limited device capability. Such challenged networks, also known as Intermittently Connected Networks (ICNs) adopt the Store-Carry-Forward (SCF) behavior arising from the mobility of mobile nodes for message relaying. In this article, we consider the term ICNs as Delay/Disruption Tolerant Networks (DTNs) for the purpose of generalization, since DTNs have been envisioned for different applications with a large number of proposed routing algorithms. Motivated by the great interest from the research community, we firstly review the existing unicasting issue of DTNs because of its extensive research stage. Then, we also address multicasting and anycasting issues in DTNs considering their perspectives. A detail survey based on our taxonomy over the period from 2006 to 2010 is not only provided but also a comparison is given. We further identify the remaining challenges and open issues followed by an evaluation framework proposed for routing in DTNs. Finally, we summarize our contribution with three future research topics highlighted.
349 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...I. INTRODUCTION DUE to the characteristic of challenged environment suf-fering from frequent disruption, sparse network density and limited device capability, routing algorithms designed for Mobile Ad hoc NETworks (MANETs) can not perform effectively under these constraints, since the availability of contemporaneous end-to-end connectivity is essential for conventional routing algorithms such as Ad hoc On-Demand Distance Vector (AODV) [1] or Dynamic Source Routing (DSR) [2]....
[...]
...DUE to the characteristic of challenged environment suffering from frequent disruption, sparse network density and limited device capability, routing algorithms designed for Mobile Ad hoc NETworks (MANETs) can not perform effectively under these constraints, since the availability of contemporaneous end-to-end connectivity is essential for conventional routing algorithms such as Ad hoc On-Demand Distance Vector (AODV) [1] or Dynamic Source Routing (DSR) [2]....
[...]
05 Nov 2008
TL;DR: This paper presents the design of a complete IPv6-based network architecture for wireless sensor networks and validate the architecture with a production-quality implementation that incorporates many techniques pioneered in the sensor network community, including duty-cycled link protocols, header compression, hop-by-hop forwarding, and efficient routing with effective link estimation.
Abstract: A decade ago as wireless sensor network research took off many researchers in the field denounced the use of IP as inadequate and in contradiction to the needs of wireless sensor networking. Since then the field has matured, standard links have emerged, and IP has evolved. In this paper, we present the design of a complete IPv6-based network architecture for wireless sensor networks. We validate the architecture with a production-quality implementation that incorporates many techniques pioneered in the sensor network community, including duty-cycled link protocols, header compression, hop-by-hop forwarding, and efficient routing with effective link estimation. In addition to providing interoperability with existing IP devices, this implementation was able to achieve an average duty-cycle of 0.65%, average per-hop latency of 62ms, and a data reception rate of 99.98% over a period of 4 weeks in a real-world home-monitoring application where each node generates one application packet per minute. Our results outperform existing systems that do not adhere to any particular standard or architecture. In light of this demonstration of full IPv6 capability, we review the central arguments that led the field away from IP. We believe that the presence of an architecture, specifically an IPv6-based one, provides a strong foundation for wireless sensor networks going forward.
345 citations
TL;DR: This paper designs a (1 + 1/s)‐approximation for the minimum‐connected dominating set in unit‐disk graphs, running in time nO((s log s)2).
Abstract: A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected. A minimum-connected dominating set is such a vertex subset with minimum cardinality. An application in ad hoc wireless networks requires the study of the minimum-connected dominating set in unit-disk graphs. In this paper, we design a (1 + 1/s)-approximation for the minimum-connected dominating set in unit-disk graphs, running in time nO((s log s)2). © 2003 Wiley Periodicals, Inc.
337 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]....
[...]