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
Journal ArticleDOI
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

10,296 citations


Additional excerpts

  • ...These routing approaches have been incorporated into wireless networks using minor modi cations, resulting in destination-sequenced distance vector (DSDV) and ad hoc on-demand distance vector (AODV) routing protocols [72, 71]....

    [...]

Journal ArticleDOI
TL;DR: This paper presents a detailed study on recent advances and open research issues in WMNs, followed by discussing the critical factors influencing protocol design and exploring the state-of-the-art protocols for WMNs.

4,205 citations

Journal ArticleDOI
01 May 2005
TL;DR: The three main categories explored in this paper are data-centric, hierarchical and location-based; each routing protocol is described and discussed under the appropriate category.
Abstract: Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. This paper surveys recent routing protocols for sensor networks and presents a classification for the various approaches pursued. The three main categories explored in this paper are data-centric, hierarchical and location-based. Each routing protocol is described and discussed under the appropriate category. Moreover, protocols using contemporary methodologies such as network flow and quality of service modeling are also discussed. The paper concludes with open research issues. � 2003 Elsevier B.V. All rights reserved.

3,573 citations

Journal ArticleDOI
01 May 2005
TL;DR: In this paper, several fundamental key aspects of underwater acoustic communications are investigated and a cross-layer approach to the integration of all communication functionalities is suggested.
Abstract: Underwater sensor nodes will find applications in oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation and tactical surveillance applications. Moreover, unmanned or autonomous underwater vehicles (UUVs, AUVs), equipped with sensors, will enable the exploration of natural undersea resources and gathering of scientific data in collaborative monitoring missions. Underwater acoustic networking is the enabling technology for these applications. Underwater networks consist of a variable number of sensors and vehicles that are deployed to perform collaborative monitoring tasks over a given area. In this paper, several fundamental key aspects of underwater acoustic communications are investigated. Different architectures for two-dimensional and three-dimensional underwater sensor networks are discussed, and the characteristics of the underwater channel are detailed. The main challenges for the development of efficient networking solutions posed by the underwater environment are detailed and a cross-layer approach to the integration of all communication functionalities is suggested. Furthermore, open research issues are discussed and possible solution approaches are outlined. � 2005 Published by Elsevier B.V.

2,864 citations


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

  • ...• Reactive protocols (e.g., AODV [ 35 ], DSR [28])....

    [...]

Journal Article
TL;DR: In this article, the authors proposed a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity.
Abstract: We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR. Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodified ad hoc routing protocol. Moreover, simulations of GAF suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern). More generally, GAF is an example of adaptive fidelity, a technique proposed for extending the lifetime of self-configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity.

2,829 citations

References
More filters
Proceedings ArticleDOI
24 Aug 2000
TL;DR: A framework for formal fault origin adjudication for network protocols using the NS simulator and the SPIN model checker is presented.
Abstract: When a program P fails to satisfy a requirement R supposedly ensured by a detailed specification S that was used to implement P, there is a question about whether the problem arises in S or in P. We call this determination fault origin adjudication and illustrate its significance in various software engineering contexts. The primary contribution of this paper is a framework for formal fault origin adjudication for network protocols using the NS simulator and the SPIN model checker. We describe our architecture and illustrate its use in a case study involving a standard specification for packet radio routing.

12 citations


"Ad hoc On-Demand Distance Vector (A..." refers background in this paper

  • ...It can be shown [1] that by the time the rebooted node comes out of the waiting phase and becomes an active router again, none of its neighbors will be using it as an active next hop any more....

    [...]