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: The simulator is written in Java and is based on the SimJava tool and allows to be adapted to various routing protocols and also allows considering other relevant aspects to ad hoc networks, like mobility patterns and traffic generation patterns.
182 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...ANEJOS shared our models with other researchers through the internet, we can use Java applets inside HTML pages containing the whole simulator....
[...]
TL;DR: A reliable Batch Mode Multicast MAC protocol (BMMM), which in most cases reduces the number of contention phases from n to 1, where n is thenumber of intended receivers in the multicast/broadcast, is proposed, which considerably reduces the time required for a multicast-broadcast.
Abstract: Multicast/broadcast is an important service primitive in networks. It is supported by all IEEE 802.x standards, including 802.11. The IEEE 802.11 multicast/broadcast protocol is based on the basic access procedure of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). This protocol does not provide any media access control (MAC) layer recovery on multicast/broadcast frames. As a result, the reliability of the multicast/broadcast service is reduced owing to the increased probability of lost frames resulting from interference or collisions. Recently, a few MAC protocols have been proposed to enhance the reliability and the efficiency of the 802.11 multicast/broadcast protocol. In this paper, we observe that these protocols are still unreliable or inefficient. To redress the problems of reliability and efficiency, we propose a reliable Batch Mode Multicast MAC protocol (BMMM), which in most cases reduces the number of contention phases from n to 1, where n is the number of intended receivers in the multicast/broadcast. This considerably reduces the time required for a multicast/broadcast. We then propose a Location Aware Multicast MAC protocol (LAMM), which uses station location information to further improve upon BMMM. Extensive analysis and simulation results validate the reliability and efficiency of our multicast MAC protocols. Copyright © 2003 John Wiley & Sons, Ltd.
182 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...[16] C. E. Perkins, E. M. Royer and S. R. Das, “Ad Hoc on Demand Distance Vector (AODV) Routing,” http://www.ietf.org/internet-drafts/draft-ietfmanet-aodv-06.tex, IETF Internet Draft, Jul. 2000....
[...]
...Moreover, even in scenarios where applications themselves do not demand multicast/broadcast, several higher layer protocols rely heavily on reliable and efficient MAC layer multicast/broadcast, for instance DSR [8], AODV [16] and ZRP [7] routing protocols....
[...]
07 Aug 2002
TL;DR: In this evaluation, one proactive protocol proved to have the best performance overall and the main input parameter associated with this protocol is evaluated for optimal performance.
Abstract: In previous years, many location based routing protocols have been developed for ad hoc networks. Some of these protocols assume a location service exists which provides location information on all the mobile nodes in the network. We evaluate three location service alternatives. One is a reactive protocol; the other two are proactive protocols. Of the proactive protocols, one sends location tables to neighbors and the other sends location information to all nodes. In our evaluation, one proactive protocol proved to have the best performance overall. Thus, we also evaluate the main input parameter associated with this protocol for optimal performance.
182 citations
TL;DR: Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs.
Abstract: In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, eg, right/left hand rules, and does not use planarization algorithms, eg, GG or RNG This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs
182 citations
16 Nov 2004
TL;DR: A novel distributed routing protocol which guarantees security, anonymity and high reliability of the established route in a hostile environment, such as an ad hoc wireless network, by encrypting the routing packet header and abstaining from using unreliable intermediate nodes.
Abstract: Providing security and privacy in mobile ad hoc networks has been a major issue over the last few years. Most research work has so far focused on providing security for routing and data content, but nothing has been done in regard to providing privacy and anonymity over these networks. We propose a novel distributed routing protocol which guarantees security, anonymity and high reliability of the established route in a hostile environment, such as an ad hoc wireless network, by encrypting the routing packet header and abstaining from using unreliable intermediate nodes. The major objective of our protocol is to allow trustworthy intermediate nodes to participate in the path construction protocol without jeopardizing the anonymity of the communicating nodes. We describe our protocol, SDAR (secure distributed anonymous routing), and provide its proof of correctness.
182 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...…environments, some nodes in the network are likely to defect and become harmful to the network, Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN’04) 0742-1303/04 $ 20.00 IEEE thereby necessitating a mechanism to identify these nodes and isolate them....
[...]
...A variety of widely known intrusion techniques may be used to infer the entities’ identities, their locations, and/or relationships between communicating entities in a public network....
[...]
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]....
[...]