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
15 Oct 2007
TL;DR: This paper uses an analytic framework to compare the two main hierarchical DHT designs, and reveals that, on the contrary to what was initially expected, the costs incurred by hierarchical superpeer design are not necessarily minimized.
Abstract: Much research in the last few years has been devoted to development of efficient structured peer-to-peer (P2P) overlay networks, which offer distributed hash table (DHT) functionality. Most of these systems have been devised as flat, non-hierarchical structures, in contrast to the most scalable distributed systems of the past. To cope with this, a significant number of hierarchical DHT designs have been proposed in the literature. Unfortunately, no design is "universally" better. Actually, what is lacking is an analytic framework to identify the good hierarchical design for a given workload. In this paper, we provide such a framework, and we use it to compare the two main hierarchical DHT designs: The homogenous design, in which all nodes act equal roles, against the superpeer design, in which a small subset of peers (i.e., the most powerful and stable), behave as proxies, interconnecting clusters with highly dynamic membership. Our analysis reveals that, on the contrary to what was initially expected, the costs incurred by hierarchical superpeer design are not necessarily minimized.
60 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...Traditional on-demand routing protocols [ 2-4 ] produce a large amount of routing control traffic by blindly flooding the entire network with RREQ packets during route discovery....
[...]
...In the on-demand routing protocols, such as AODV [ 2 ] and DSR [3], routes are discovered only when they are needed....
[...]
...On-demand routing protocols [ 2-4 ] construct a path to a given destination only when it is required....
[...]
...In conventional on-demand routing protocols [ 2-4 ], a node that needs to discover a route to a particular destination, broadcasts a Route Request control packet (RREQ) to its immediate neighbours....
[...]
...Many routing protocols have been suggested for MANETs over the past few years [ 2-7 ]....
[...]
TL;DR: Extensive studies simulations for DSR, AODV, LAR1, FSR and WRP in homogenous and heterogeneous networks that consist of different nodes with different resources showed that while all protocols perform reasonably well in homogeneous networking conditions, their performance suffer significantly over heterogonous networks.
60 citations
TL;DR: This paper has proposed an approach to verify the correct forwarding of packets by an intermediate node, and compared it with the watchdog and the 2-hop ACK which are well-known approaches in the literature.
60 citations
Cites background or methods from "Ad hoc On-Demand Distance Vector (A..."
...Ad hoc On-Demand Distance Vector (AODV) (Perkins et al., 2003) is a reactive routing protocol designed to provide routes on demand....
[...]
...Sharma and Gupta (2009) provided a simulation study in which an AODV-based network performance, in the presence of packet droppers, is reduced up to 26%....
[...]
...Focused on Ad hoc On-Demand Distance Vector (AODV) (Perkins et al., 2003) routing protocol, Kurosawa et al. (2007) try to detect abnormality which occurs during the packet dropping attack by defining a normal state from dynamic training data that is updated at regular time intervals....
[...]
...In Section 3, we will explain how the dropper node conducts a successful attack in AODV (Perkins et al., 2003), which is a reactive routing protocol, and in OLSR (Clausen and Jacquet, 2003) which is a proactive routing protocol....
[...]
...Focused on Ad hoc On-Demand Distance Vector (AODV) (Perkins et al., 2003) routing protocol, Kurosawa et al....
[...]
01 Jan 2005
TL;DR: Transmission control protocol (TCP) is a transport layer protocol which provides reliable end-to-end data delivery between end hosts in traditional wired network environment and has become the de facto transport protocol in the Internet that supports many applications such as web access, file transfer and email.
Abstract: As a result of the advancement of wireless technology and the proliferation of handheld wireless terminals, recent years have witnessed an ever-increasing popularity of wireless networks, ranging from wireless Local Area Networks (WLANs) and wireless wide-area networks (WWANs) to mobile ad hoc networks (MANETs). In WLANs (e.g., the Wi-Fi technology) or in WWANs (e.g., 2.5G/3G/4G cellular networks), mobile hosts communicate with an access point or a base station that is connected to the wired networks. Obviously, only one hop wireless link is needed for communications between a mobile host and a stationary host in wired networks. In contrast, there is no fixed infrastructure such as base stations or access points in a MANET. Each node in a MANET is capable of moving independently and functioning as a router that discovers and maintains routes and forwards packets to other nodes. Thus, MANETs are multi-hop wireless networks by nature. Note that MANETs may be connected at the edges to the wired Internet. Transmission control protocol (TCP) is a transport layer protocol which provides reliable end-to-end data delivery between end hosts in traditional wired network environment. In TCP, reliability is achieved by retransmitting lost packets. Thus, each TCP sender maintains a running average of the estimated round trip delay and the average deviation derived from it. Packets will be retransmitted if the sender receives no acknowledgment within a certain timeout interval (e.g., the sum of smoothed round trip delay and four times the average deviation) or receives duplicate acknowledgments. Due to the inherent reliability of wired networks, there is an implicit assumption made by TCP that any packet loss is due to congestion. To reduce congestion, TCP will invoke its congestion control mechanisms whenever any packet loss is detected. Since TCP is well tuned, it has become the de facto transport protocol in the Internet that supports many applications such as web access, file transfer and email. Due to its wide use in the Internet, it is desirable that TCP remains in use to provide reliable data transfer services for communications within wireless networks and for those across wireless networks and the wired Internet. It is thus crucial that TCP performs well over all kinds of wireless networks in order for the wired Internet to extend to the wireless world. Unfortunately, wired networks and wireless networks are significantly different in terms of bandwidth, propagation delay, and link reliability. The implication of the difference is that packet losses are no longer mainly due to network congestion; they may well be due to some wireless specific reasons. As a matter of fact, in wireless LANs or cellular networks, most packet losses are due to high bit error rate in wireless channels and handoffs between two cells, while in mobile ad hoc networks, most packet losses are due to medium contention and route breakages, as well as radio channel errors. Therefore, although TCP performs well in wired networks, it will suffer from
60 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...This fast retransmission would force routing protocol especially like AODV [ 37 ] and DSR to repair routes fast, which in turn leads to a large congestion window on average and high TCP throughput....
[...]
TL;DR: This study presents a novel approach based on concurrent, bidirectional data packet exchange to improve the data transmission efficiency in underwater networks, and proposes an asynchronous handshaking-based MAC protocol, which is called biddirectional-concurrent MAC with packet bursting (BiC-MAC).
Abstract: The underwater acoustic channel is fundamentally different from the terrestrial wireless channel. Its unique characteristics, such as slow propagation speed and small bit rate distance product, present both challenges and opportunities for media access control (MAC) protocol design. In existing handshaking-based MAC protocols, each successful handshake only allows an initiating sender to transmit a single or multiple consecutive data packets to its intended receiver. In a long propagation delay environment, this unidirectional data transmission often results in extremely poor channel utilization due to the long waiting time for the handshake to complete. By exploiting the channel's unique characteristics, we present a novel approach based on concurrent, bidirectional data packet exchange to improve the data transmission efficiency. To further amortize the high latency overhead, we adopt a packet bursting idea, where a sender-receiver pair can exchange multiple rounds of bidirectional packet transmissions. Based on these strategies, we propose an asynchronous handshaking-based MAC protocol, which we call bidirectional-concurrent MAC with packet bursting (BiC-MAC). Via extensive simulations, we compare BiC-MAC against two representative unidirectional handshaking-based protocols, as well as several existing MAC protocols. We demonstrate that BiC-MAC can significantly increase channel utilization and offer performance gains in terms of both throughput and delay, while achieving a stable saturation throughput. Our study highlights the value of adopting bidirectional, concurrent transmission in underwater networks.
60 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
..., AODV [22]), every node periodically updates its own routing table to all destinations, so that it knows exactly which next-hop neighbor should be chosen when it wishes to relay the incoming packets....
[...]
...For hop-by-hop routing protocols (e.g., AODV [22]), every node periodically updates its own routing table to all destinations, so that it knows exactly which next-hop neighbor should be chosen when it wishes to relay the incoming packets....
[...]
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]....
[...]