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
TL;DR: A novel blockchain-based contractual routing (BCR) protocol for a network of untrusted IoT devices that enables distributed routing in heterogeneous IoT networks and is fairly resistant to both Blackhole and Greyhole attacks.
Abstract: In this paper, we propose a novel blockchain-based contractual routing (BCR) protocol for a network of untrusted IoT devices. In contrast to conventional secure routing protocols in which a central authority (CA) is required to facilitate the identification and authentication of each device, the BCR protocol operates in a distributed manner with no CA. The BCR protocol utilizes smart contracts to discover a route to a destination or data gateway within heterogeneous IoT networks. Any intermediary device can guarantee a route from a source IoT device to a destination device or gateway. We compare the performance of BCR with that of the Ad-hoc On-Demand Distance Vector (AODV) routing protocol in a network of devices. The results show that the routing overhead of the BCR protocol is times lower compared to AODV at the cost of a slightly lower packet delivery ratio. BCR is fairly resistant to both Blackhole and Greyhole attacks. The results show that the BCR protocol enables distributed routing in heterogeneous IoT networks.
81 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...(iii) We compare the performance of BCRwith that ofAdhoc On-Demand Distance Vector (AODV) which is a commonly used routing protocol [20]....
[...]
22 Apr 2003
TL;DR: Two kinds of advertising schemes are proposed, which are based on the observation of traffic and mobility patterns, and are designed to avoid generating unnecessary packets in the MANET (Mobile Ad hoc Network), in addition to giving mobile nodes more opportunity to use the shortest path to the Internet.
Abstract: When a node in a mobile ad hoc network wants to send data packets to the Internet, and therefore outside of its local ad hoc network, it has to obtain information about the available Internet gateways: i.e. which one to use and how to get there. To accomplish this, nodes can utilize either a unsolicited gateway discovery mechanism or relay on unsolicited gateway advertisement packets sent by gateways. Obviously, the effectiveness of periodic and unsolicited advertisement depends entirely on the traffic and mobility patterns. The most important factors involved in sending unsolicited gateway advertisements are the time interval between sending two consecutive advertisements and the TTL value of the advertisement packet, i.e., the gateway should carefully decide when to send advertisements, and the advertisement flooding area should be limited only to nodes that need to update their gateway information and their paths to the gateway. In this paper, two kinds of advertising schemes are proposed, which are based on the observation of traffic and mobility patterns, and are designed to avoid generating unnecessary packets in the MANET (Mobile Ad hoc Network), in addition to giving mobile nodes more opportunity to use the shortest path to the Internet.
81 citations
Patent•
05 May 2005
TL;DR: In this paper, a multicast routing algorithm for wireless ad-hoc networks without any fixed infrastructure nodes present is presented, where the multicast tree is constructed on demand using a core source node to limit routing overhead.
Abstract: A system and method for supporting multicast in highly dynamic wireless multi-hop networks, such as ad-hoc networks, with good scalability. The system and method provide a multicast routing algorithm to work in wireless ad-hoc networks without any fixed infrastructure nodes present. In doing so, the system and method provide a technique to build a multicast source specific tree on demand, while using a core source node to limit routing overhead. The system and method further provide a repair process to reduce the latency of discovery of topology change, employ a node sequence number mechanism to differentiate between upstream nodes and downstream nodes on the multicast tree in the repair process, and provide an active joining process to reduce the latency of discovery of membership change.
81 citations
19 Jun 2004
TL;DR: This work introduces the notion of multi-objective route selection in mobile ad hoc networks (MANET) using a evolutionary fuzzy cost function to deliberately calculate cost adaptively.
Abstract: The complexity involved in implementing multi-objective routing in computer networks has led to many researchers exploring alternate solutions with the use of heuristic based techniques. The rationale underlying the use of heuristic based priorities in achieving multiple objectives appears to be ad hoc and unclear due to the complex interactions among the various objectives. However these uncertainties can be effectively modeled using fuzzy set theory. This work introduces the notion of multi-objective route selection in mobile ad hoc networks (MANET) using a evolutionary fuzzy cost function to deliberately calculate cost adaptively. The fuzzy cost function is a continuous function of the metrics describing the state of a route. Simulation results demonstrate the superiority of the proposed technique over conventional MANET routing schemes.
81 citations
29 May 2006
TL;DR: In this article, the authors present the results of a detailed simulation study of three multi-path routing protocols (SMR, AOMDV and AODV_Multipath) obtained with the ns-2 simulator.
Abstract: Multi-path routing represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves load balancing and is more resilient to route failures. Recently, numerous multi-path routing protocols have been proposed for wireless mobile ad hoc networks. Performance evaluations of these protocols showed that they achieve lower routing overhead, lower end-to-end delay and alleviate congestion in comparison with single path routing protocols. However, a quantitative comparison of multi-path routing protocols has not yet been conducted. In this work, we present the results of a detailed simulation study of three multi-path routing protocols (SMR, AOMDV and AODV_Multipath) obtained with the ns-2 simulator. The simulation study shows that the AOMDV protocol achieves best performance in high mobility scenarios, while AODV_Multipath performs better in scenarios with low mobility and higher node density. SMR performs best in networks with low node density, however as density increases, the protocol's performance is degrading.
81 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]....
[...]