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
19 Sep 2003
TL;DR: Improvements to NS-2 to meet the needs of large ad hoc network simulations are described, based on the idea of exploiting the limited interference of wireless communication, which has simulated populations of up to 3000 nodes so far and works up to 30 times faster than the original version.
Abstract: This research was supported, in part, by the NCCR "Mobile Information and Communication Systems", a research program of the Swiss National Science Foundation, and by a gift from the Microprocessor Research Lab (MRL) of Intel Corp.An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad hoc networks often involves simulators since management and operation of a large number of nodes is expensive. However, the widely used simulator NS-2 does not scale; it is very hard to simulate medium scale networks with 100+ nodes. We describe here improvements to NS-2 to meet the needs of large ad hoc network simulations. The modified NS-2 simulator is based on the idea of exploiting the limited interference of wireless communication. The modified simulator has simulated populations of up to 3000 nodes so far and works up to 30 times faster than the original version. We also discuss how the modified simulator is validated.
108 citations
TL;DR: The calculations suggest that interference is upper-bounded in wireless ad-hoc networks that use carrier sensing for medium access control, and from the point of view of throughput optimization, show limits on the network size and input data rates per node.
Abstract: In this paper we propose a new model to calculate interference levels in wireless multi-hop ad-hoc networks. This model computes the expected value of Carrier to Interference ratio (C/I) by taking into account the number of nodes, density of nodes, radio propagation aspects, multi-hop characteristics of the network, and the amount of relay traffic. The expected values of C/I are used to determine network capacity and data throughput per node. Our model uses a regular lattice for possible locations of mobile nodes. This enables us to calculate the expected values of C/I, without having detailed information about movement patterns and exact location of all nodes at any moment. Based on this model we have evaluated effects of variations in the network size, network density and traffic load on C/I, and consequently throughput of the network. Our calculations suggest that interference is upper-bounded in wireless ad-hoc networks that use carrier sensing for medium access control. Further, from the point of view of throughput optimization, our calculations show limits on the network size and input data rates per node.
108 citations
TL;DR: This paper presents a traffic-aware position-based routing protocol for vehicular ad hoc networks (VANETs) suitable for city environments that uses an ant-based algorithm to find a route that has optimum network connectivity.
Abstract: This paper presents a traffic-aware position-based routing protocol for vehicular ad hoc networks (VANETs) suitable for city environments. The protocol is an enhanced version of the geographical source routing (GSR) protocol. The proposed protocol, named efficient GSR, uses an ant-based algorithm to find a route that has optimum network connectivity. It is assumed that every vehicle has a digital map of the streets comprised of junctions and street segments. Using information included in small control packets called ants, the vehicles calculate a weight for every street segment proportional to the network connectivity of that segment. Ant packets are launched by the vehicles in junction areas. In order to find the optimal route between a source and a destination, the source vehicle determines the path on a street map with the minimum total weight for the complete route. The correct functionality of the proposed protocol has been verified, and its performance has been evaluated in a simulation environment. The simulation results show that the packet delivery ratio is improved by more than 10% for speeds up to 70 km/h compared with the VANET routing protocol based on ant colony optimization (VACO) that also uses an ant-based algorithm. In addition, the routing control overhead and end-to-end delay are also reduced.
107 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...[4] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc on-demand distance vector (AODV) routing,” RFC 3561, Jul. 2003....
[...]
...DYMO itself is an improved version of AODV....
[...]
...In terms of routing control overhead, it does not show much improvement against AODV due to the interzone proactive routing approach....
[...]
...Hybrid location-based ad hoc routing [37] combines the features of geographical greedy forwarding and AODV to reduce the routing control overhead in the latter....
[...]
...VNAODV+ [36] is a cluster-based routing protocol based on AODV, which has been proposed to solve the high overhead and instability of the routes in AODV for high-mobility scenarios....
[...]
TL;DR: This paper presents the Core-Assessment Mesh Protocol, which uses meshes for data forwarding, and avoids flooding by generalizing the notion of core-based trees introduced for internet multicasting.
Abstract: Most of the multicast routing protocols for ad hoc networks today are based on shared or source-based trees; however, keeping a routing tree connected for the purpose of data forwarding may lead to a substantial network overhead. A different approach to multicast routing consists of building a shared mesh for each multicast group. In multicast meshes, data packets can be accepted from any router, as opposed to trees where data packets are only accepted from routers with whom a “tree branch” has been established. The difference among multicast routing protocols based on meshes is in the method used to build these structures. Some mesh-based protocols require the flooding of sender or recieved announcements over the whole network. This paper presents the Core-Assisted Mesh Protocol, which uses mesh for data forwarding, and avoids flooding by generalizing the notion of core-based trees introduced for internet multicasting. Group members form the mesh of a group by sending join requests to a set of cores. SImulation experiments show that meshes can be used effectively as multicast routing structures without the need for flooding control packets.
107 citations
Patent•
21 Nov 2008
TL;DR: In this article, a method and system facilitate communications between an unassociated device and a server via a mesh network and a wide area network, where each candidate proxy device is associated with mesh network.
Abstract: A method and system facilitate communications between an unassociated device and a server via a mesh network and a wide area network. The method may include receiving transmissions from candidate proxy devices, wherein each candidate proxy device is associated with a mesh network. The method may include selecting a proxy device from the candidate proxy devices. The method may include communicating with a server via the proxy device and the associated mesh network.
107 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]....
[...]