scispace - formally typeset
Search or ask a question

Ad hoc On-Demand Distance Vector (AODV) Routing

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.

Content maybe subject to copyright    Report

Citations
More filters
Proceedings Article•DOI•
Guido R. Hiertz1, Sebastian Max1, Rui Zhao1, Dee Denteneer2, L. Berlemann3 •
24 Sep 2007
TL;DR: In 2003, interests in the Institute of Electronics and Electrical Engineering (IEEE) 802.11 Working Group (WG) led to the formation of Task Group (TG) "s", which develops a Wireless Mesh Network (WMN) amendment and considers extensions to the Medium Access Control (MAC) too.
Abstract: In 2003, interests in the Institute of Electronics and Electrical Engineering (IEEE) 802.11 Working Group (WG) led to the formation of Task Group (TG) "S". 802.11s develops a Wireless Mesh Network (WMN) amendment. Unlike existing Mesh products, 802.11s forms a transparent 802 broadcast domain that supports any higher layer protocols. Therefore, 802.11s provides frame forwarding and path selection at layer-2. 802.11i describes a security concept for stations that associate with an Access Point (AP). However, in a Mesh Basic Service Set (BSS) devices need to mutually authenticate to provide integrity of the network. Thus, 802.11s adds additional elements to the concepts of 802.11L While traditional Wireless Local Area Networks (WLANs) are AP centred an 802.11 Mesh is fully distributed. Hence, 802.11s considers extensions to the Medium Access Control (MAC) too. The authors have contributed to the standardization of 802.11s since 2003. As constant participants we give insight to draft 1.02 of TG "s" and provide an outlook to future evolution of 802.11's first Mesh standard.

124 citations

Proceedings Article•DOI•
01 Jun 2003
TL;DR: This paper addresses the problem of energy-conscious cache placement in wireless ad hoc networks with a polynomial time algorithm which provides a sub-optimal solution and compares the performance of the algorithm against three candidate caching schemes, and shows that it consistently outperforms these alternative schemes.
Abstract: In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks We consider a network comprising a server with an interface to the wired network, and some nodes requiring access to the information stored at the server In order to reduce access latency in such a communication environment, an effective strategy is caching the server information at some nodes distributed across the network Caching, however, can considerably impact the system energy expenditure; for instance, disseminating information incurs additional energy burden Since wireless devices have limited amounts of available energy, we need to design caching strategies that optimally trade-off between energy consumption and access latency We pose our problem as an integer linear program We show that this problem is the same as a special case of the connected facility location problem, which is known to be NP-hard We devise a polynomial time algorithm which provides a sub-optimal solution The proposed algorithm applies to any arbitrary network topology and can be implemented in a distributed and asynchronous manner In the case of a tree topology, our algorithm gives the optimal solution In the case of an arbitrary topology, it finds a feasible solution with an objective function value within a factor of 6 of the optimal value This performance is very close to the best approximate solution known today, which is obtained in a centralized manner We compare the performance of our algorithm against three candidate caching schemes, and show via extensive simulation that our algorithm consistently outperforms these alternative schemes

124 citations

Journal Article•DOI•
TL;DR: This paper contributes to the networking community by providing a better understanding of self-organization mechanisms focusing especially on the applicability in ad hoc and sensor networks.

124 citations


Cites background from "Ad hoc On-Demand Distance Vector (A..."

  • ...Best-known examples are AODV (Ad-Hoc On Demand Distance Vector Routing) [44,45] and its successor DYMO (Dynamic MANET On Demand) [46]....

    [...]

Proceedings Article•DOI•
13 Apr 2010
TL;DR: This paper reviews some of the state-of-the-art and widely investigated MANET routing strategies in the literature and a performance comparison of discussed routing protocol strategies is provided and suggestions are made to achieve improvement in performance of these protocols.
Abstract: Mobile Ad Hoc Networks (MANETs) are generating a lot of interests due to 3G and 4G activities. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to-end communication. Due to the diverse applications that use MANETs, such as battlefield, emergency services, and disaster discovery, MANETs offer many advantages to many organizations that need wireless roaming. For efficient and timely use, routing and synchronization are essential. Both are hot research topics in MANETs. This paper concentrates on routing, which is a challenging task and has seen a huge number of different strategies proposed, each claiming to provide an improvement over other strategies. These competing strategies make it quite difficult to determine which one may perform optimally under a number of different sets of network conditions as defined by their Quality of Service (QoS) offerings. This paper reviews some of the state-of-the-art and widely investigated MANET routing strategies in the literature. Moreover, a performance comparison of discussed routing protocol strategies is provided and suggestions are made to achieve improvement in performance of these protocols. This research is followed by presenting further research that will be pursued to define a radically most optimum set of strategies to satisfy different types of application domains.

123 citations


Cites methods from "Ad hoc On-Demand Distance Vector (A..."

  • ...However, there are major differences between DSR and AODV....

    [...]

  • ...A node can confirm if a packet is correctly received by its downstream node (backward Following are some of the well-known reactive routing protocols with their characteristics in MANETs: The Ad hoc on Demand Distance Vector (AODV) [18] routing protocol is based on DSDV and DSR [19] protocols....

    [...]

  • ...The most distinguishing feature is that in DSR each packet carries full routing information whereas in AODV the packets only carry the destination address meaning that AODV has potentially less routing overheads than DSR....

    [...]

  • ...In on-demand routing protocol, DSR and AODV which are flooding based have scalability problem....

    [...]

  • ...The Dynamic Source Routing (DSR) protocol requires each transmitted packet to carry the full address from the source to the destination likewise the mechanism used in AODV....

    [...]

01 Jan 2003
TL;DR: The ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile ad hoc network and the Internet and three proposed approaches for gateway discovery are implemented and investigated.
Abstract: Ad hoc networking allows portable devices to establish communication independent of a central infrastructure. However, the fact that there is no central infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this thesis the problem of routing is considered. There are several ad hoc routing protocols, such as AODV1, DSR2, OLSR3 and ZRP4, that propose solutions for routing within a mobile ad hoc network. However, since there is an interest in communication between not only mobile devices in an ad hoc network, but also between a mobile device in an ad hoc network and a fixed device in a fixed network (e.g. the Internet), the ad hoc routing protocols need to be modified. In this thesis the ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile ad hoc network and the Internet. For this purpose Network Simulator 2, NS 2, has been used. Moreover, three proposed approaches for gateway discovery are implemented and investigated. 1Ad hoc On-Demand Distance Vector 2Dynamic Source Routing 3Optimized Link State Routing Protocol 4Zone Routing Protocol

123 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]....

    [...]