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: This paper systematically discuses the performance evaluation and comparison of four typical routing protocols of ad hoc networks with the different simulation model and metrics, and drew more complete and valuable conclusions.
146 citations
Journal Article•
TL;DR: In this paper, a robust multicasting in ad hoc networks using trees (ROMANT) protocol is proposed, which does not require a unicast routing protocol or the pre-assignment of cores to groups.
Abstract: Efficient and Robust Multicast Routing in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz ravindra@cseucscedu Abstract— This paper argues that tree based protocols can have packet delivery ratios comparable to mesh based protocols if the tree construction algorithm can fix and detect broken links quickly, and at the same time have a much lower data packet overhead due to the absence of redundancy We present such a protocol and call it robust multicasting in ad hoc networks using trees (ROMANT) ROMANT does not require a unicast routing protocol or the preassignment of cores to groups We compare ROMANT with ODMRP and MAODV which are the state of the art in mesh based and tree based protocols respectively The results from a wide range of scenarios of varying mobility, group members, number of senders, traffic load and number of multicast groups show that ROMANT attains a comparable or better packet delivery ratio than ODMRP and MAODV, and a much lower control overhead which is almost constant for a fixed number of groups, and varies sublinearly with increasing groups Keywords— Ad hoc networks, multicast mesh, multicast tree routing, multicasting, I I NTRODUCTION Mobile ad hoc networks have applications in a wide range of areas including disaster relief and military Most of these scenarios need one to many or many to many communication In fact, some networks may need multicast routing only and not need unicast routing at all This makes multicasting a very important feature in such networks As a result, it is important to have a multicasting protocol that provides a high packet delivery ratio even in extreme conditions (eg, high mobility and high traffic load) It is equally important for such protocols to have a low over- head, because bandwidth and battery power are extremely precious in these kinds of networks Over the past few years, several multicast routing proto- cols have been proposed for ad hoc networks [1], [2], [3], [16] For the purposes of our discussion, the approaches taken to date can be classified into tree-based and mesh- based approaches A tree-based multicast routing protocol establishes and maintains either a shared multicast routing tree or multiple source-based multicast routing trees (one for each group source) to deliver data packets from sources to receivers of a multicast group Recent examples of tree-based multicast routing approaches are the multicast ad hoc on-demand distance vector protocol (MAODV) [4], and the adaptive JJ Garcia-Luna-Aceves Department of Computer Engineering University of California Santa Cruz jj@cseucscedu demand-driven multicast routing protocol (ADMR) [8] In contrast, a mesh-based multicast routing protocol maintains a mesh consisting of a connected component of the network containing all the receivers of a group Two well-known examples of mesh-based multicast routing protocols are the core assisted mesh protocol (CAMP) [1] and the on-demand multicast routing protocol (ODMRP) [2] MAODV maintains a shared tree for each multicast group, consisting of only receivers and relays Sources wishing to send to the group acquire routes to the group on demand in a way similar to the ad hoc on demand distance vector (AODV) [17] protocol Each multicast tree has a group leader, which is the first node to join the group in the connected component The group leader in each connected component periodically transmits a group hello packet to become aware of reconnections Receivers join the shared tree with a special route request The route replies coming from different multicast tree members specify the number of hops to the nearest tree member The node wishing to join the tree joins through the node reporting the freshest route with the minimum hop count to the tree ADMR maintains source-based trees, ie, a multicast tree for each source of a multicast group A new receiver performs a network-wide flood of a multicast solicitation packet when it needs to join a multicast tree Each group source replies to the solicitation, and the receiver sends a re- ceiver join packet to each source answering its solicitation An individual source-based tree is maintained by periodic keep-alive packets from the source, which allow routers to detect link breaks in the tree by the absence of data or keep-alive packets A new source of a multicast group also sends a network-wide flood to allow existing group receivers to send receiver joins to the source MZR [15] like ADMR, maintains source based trees MZR performs zonal routing; hence, the flooding of control packets is less expensive Compared to approaches based on shared trees, the use of source-based trees creates much more state at routers participating in many groups, each with multiple sources ODMRP requires control packets originating at each source of a multicast group to be flooded throughout the ad hoc network The control packet floods help repair the link breaks that occur between floods The limitations of ODMRP are the need for network-wide packet floods and requiring that the sources of multicast packets for a
145 citations
TL;DR: AODVjr, a simplified version of the AODV protocol, is described and it is compared in simulation to a full featured A ODV implementation and describes other positive effects of a smaller protocol specification.
Abstract: In this paper AODVjr, a simplified version of the AODV protocol, is described. AODVjr is compared in simulation to a full featured AODV implementation. The results show that AODVjr performs as well as AODV and describes other positive effects of a smaller protocol specification.
145 citations
Patent•
26 Apr 2006TL;DR: Autoband as discussed by the authors is a distributed networking intelligence that provides a novel architecture capable of dynamically reconfiguring communications pathways consisting of links whose transmission media are opportunistically and dynamically selectable, at least one constituent node in such automatically configurable transient pathways is mobile, for example, information (source) server, intervening router node(s), gateway server and/or client device.
Abstract: Autoband's distributed networking intelligence provides a novel architecture capable of dynamically reconfiguring communications pathways consisting of links whose transmission media are opportunistically and dynamically selectable. At least one constituent node in such automatically configurable transient pathways is mobile, for example, information (source) server, intervening router node(s), gateway server and/or client device. Additionally, Autoband's ad hoc communications pathways may seamlessly and dynamically integrate (i.e., “graft”) into standard fixed node networks such as terrestrial networks, other wireless networks or combinations thereof. These communications may consist of point-to-point or multicast links. An economic market-based approach further assures allocation of available network resources (i.e., bandwidth and processing) needed to achieve the most optimally resource efficient communications pathway configurations for the totality of communications. Consequently, optimal network resource allocation and efficiency at a system-wide level is continuously achieved.
145 citations
TL;DR: Simulation results demonstrate that the proposed centralized routing scheme outperforms others in terms of transmission delay, and the transmission performance of the proposed routing scheme is more robust with varying vehicle velocity.
Abstract: Establishing and maintaining end-to-end connections in a vehicular ad hoc network (VANET) is challenging due to the high vehicle mobility, dynamic inter-vehicle spacing, and variable vehicle density. Mobility prediction of vehicles can address the aforementioned challenge, since it can provide a better routing planning and improve overall VANET performance in terms of continuous service availability. In this paper, a centralized routing scheme with mobility prediction is proposed for VANET assisted by an artificial intelligence powered software-defined network (SDN) controller. Specifically, the SDN controller can perform accurate mobility prediction through an advanced artificial neural network technique. Then, based on the mobility prediction, the successful transmission probability and average delay of each vehicle's request under frequent network topology changes can be estimated by the roadside units (RSUs) or the base station (BS). The estimation is performed based on a stochastic urban traffic model in which the vehicle arrival follows a non-homogeneous Poisson process. The SDN controller gathers network information from RSUs and BS that are considered as the switches. Based on the global network information, the SDN controller computes optimal routing paths for switches (i.e., BS and RSU). While the source vehicle and destination vehicle are located in the coverage area of the same switch, further routing decision will be made by the RSUs or the BS independently to minimize the overall vehicular service delay. The RSUs or the BS schedule the requests of vehicles by either vehicle-to-vehicle or vehicle-to-infrastructure communication, from the source vehicle to the destination vehicle. Simulation results demonstrate that our proposed centralized routing scheme outperforms others in terms of transmission delay, and the transmission performance of our proposed routing scheme is more robust with varying vehicle velocity.
145 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...Therefore, traditional routing schemes such as optimized link state protocol (OLSR) [5], ad hoc on-demand distance vector (ADOV) [6] and dynamic source routing (DSR) [7] are not efficient or fully applicable to VANET....
[...]
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]....
[...]