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
18 Aug 2002
TL;DR: A method in which the intermediate node requests its next hop to send a confirmation message to the source, which discourages malicious nodes from intercepting packets and shows a remarkable improvement in throughput.
Abstract: A wireless ad hoc network is a collection of mobile nodes with no fixed infrastructure. The absence of a central authorization facility in dynamic and distributed environments requires collaboration among nodes. When a source searches for a route to a destination, an intermediate node can reply with its cached entry. To strengthen correctness of such a routing discovery process, we propose a method in which the intermediate node requests its next hop to send a confirmation message to the source. After receiving both a route reply and confirmation message, the source determines the validity of a path according to its policy. As a result, this strategy discourages malicious nodes from intercepting packets. Simulation results show a remarkable improvement in throughput (30% higher delivery ratio and 10% less data transmission overhead) with a moderate increase of control messages.
128 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Reactive routing determines routes on an as-needed basis: when a node has a packet to transmit, it queries the network for a route [8, 15, 17]....
[...]
...As observed in DSR, caching route information is common in ad hoc network routing protocols to save packet transmission and reduce route acquisition latency [8, 17]....
[...]
...In many on-demand ad hoc routing protocols [8, 17], intermediate nodes can answer route discovery request from the source if they have a route to the destination in their route caches....
[...]
TL;DR: This article discusses the implementation of the secure AODV protocol extension, which includes tuning strategies aimed at improving its performance, and proposes an adaptive mechanism that tunes SAODV behavior.
Abstract: Mobile ad hoc networks pose new kinds of security problems, caused by their nature of collaborative and open systems and by limited availability of resources. In this article, we consider a Wi-Fi connectivity data link layer as a basis and focus on routing security. We discuss our implementation of the secure AODV protocol extension, which includes tuning strategies aimed at improving its performance. Namely, we propose an adaptive mechanism that tunes SAODV behavior. Moreover, we analyze our adaptive strategy and another technique that delays the verification of digital signatures. This article sums up the experimental results we collected in the prototype design, implementation, and tuning.
127 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...AODV [3], [4] is perhaps the most well-known routing protocol for MANETs....
[...]
TL;DR: A systematical investigation of current state-of-the-art algorithms for the energy-aware multicast routing problem and the MLB/MLM problem in wireless ad hoc networks with omni-directional and directional antennas is presented.
127 citations
TL;DR: An extended ID (EID) connectionless broadcast scheme is introduced, which, compared with original Bluetooth broadcast mechanism, achieves very much shortened route discovery delay and is presented as the first effort to address on-demand scatternet formation with every detail.
Abstract: Bluetooth scatternets, integrating polling, and frequency hopping spread-sprectrum in their medium access control protocol, provide a contention-free environment for Bluetooth devices to access the medium and communicate over multihop links. Currently, most available scatternet formation protocols tend to interconnect all Bluetooth devices at the initial network startup stage and maintain all Bluetooth links thereafter. Instead of this "big scatternet" approach, we propose a scatternet-route structure to combine the scatternet formation with on-demand routing, thus eliminating unnecessary link and route maintenances. To the best of our knowledge, this is the first effort to address on-demand scatternet formation with every detail. We introduce an extended ID (EID) connectionless broadcast scheme, which, compared with original Bluetooth broadcast mechanism, achieves very much shortened route discovery delay. We also propose to synchronize the piconets along each scatternet route to remove piconet switch overhead and obtain even better channel utilization. Furthermore, we present a route-based scatternet scheduling scheme to enable fair and efficient packet transmissions over scatternet routes. Network performance analysis and simulations show that scatternet routes can provide multihop wireless channels with high network utilization and extremely stable throughput, being especially useful in the transmission of large batches of packets and real time data in wireless environment.
126 citations
TL;DR: A comprehensive review of the literature on reinforcement learning-based routing protocols is provided, structured in a way that shows how network characteristics and requirements were gradually considered over time.
Abstract: Reinforcement learning (RL), which is a class of machine learning, provides a framework by which a system can learn from its previous interactions with its environment to efficiently select its actions in the future. RL has been used in a number of application fields, including game playing, robotics and control, networks, and telecommunications, for building autonomous systems that improve themselves with experience. It is commonly accepted that RL is suitable for solving optimization problems related to distributed systems in general and to routing in networks in particular. RL also has reasonable overhead—in terms of control packets, memory and computation—compared to other optimization techniques used to solve the same problems. Since the mid-1990s, over 60 protocols have been proposed, with major or minor contributions in the field of optimal route selection to convey packets in different types of communication networks under various user QoS requirements. This paper provides a comprehensive review of the literature on the topic. The review is structured in a way that shows how network characteristics and requirements were gradually considered over time. Classification criteria are proposed to present and qualitatively compare existing RL-based routing protocols.
126 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...RL-AODV(NATG) (RL-based AODV) – [38] proposed a modification to AODV protocol [39] to make the next-hop selection dependent on the experience gained through reinforcement learning andmore aware of network dynamics....
[...]
...[66], [68], [70], [74]) are extensions to the well-known AODV protocol [39]....
[...]
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]....
[...]