scispace - formally typeset
Search or ask a question

Ad hoc On-Demand Distance Vector (AODV) Routing

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.

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: Security analysis and extensive experiments show that the proposed mutual-healing group key distribution scheme can effectively resist various attacks with small overhead on time and storage.
Abstract: A dynamic group key is required for secure communication in the Unmanned Aerial Vehicles Ad-Hoc Network (UAANET). However, due to the unreliable wireless channel and high-dynamic topology of UAANET, the situation that a node is missing certain group key broadcast messages occurs frequently. Existing group key distribution schemes cannot be directly applied to the UAANET, because of their poor security or real-time. Therefore, we present a mutual-healing group key distribution scheme based on the blockchain. Firstly, the Ground Control Station (GCS) builds a private blockchain where the group keys distributed by GCS are recorded. Meanwhile, through the blockchain, a dynamic list of UAANET membership certificates is also managed. According to different attack models, a basic mutual-healing protocol and an enhanced one are designed based on the Longest-Lost-Chain mechanism to recover the node's lost group keys with the aid of its neighbors. Security analysis and extensive experiments show that, compared with the existing mutual-healing schemes, our proposed solution can effectively resist various attacks with small overhead on time and storage.

71 citations

Proceedings ArticleDOI
01 Jul 2002
TL;DR: An approach that utilizes network survivability concepts to detect the critical links in an ad hoc wireless network and propose two ways to delay or avoid their failure: change the trajectory of one or both nodes forming the critical link; and bring in another node to reinforce the link.
Abstract: Due to unpredictable mobility patterns, nodes in an ad hoc wireless network can get separated into partitions and reconnected a number of times. Whenever a larger partition divides into two smaller ones, there is a critical link that fails and thus divides the partition into two. We propose an approach that utilizes network survivability concepts to detect the critical links in an ad hoc wireless network. Once the critical link has been detected, we propose two ways to delay or avoid their failure: change the trajectory of one or both nodes forming the critical link; and bring in another node to reinforce the link. It is assumed that the nodes know their location and periodically update their neighbors with their current locations. We have implemented these techniques in the network simulator ns-2. The simulation experiments show that the approach can significantly improve the network performance and reduce the degree of partitioning.

71 citations


Cites methods from "Ad hoc On-Demand Distance Vector (A..."

  • ...We simulate the scheme with the AODV [4, 9] protocol as it already maintains neighbor lists and timers simplifying our simulation programming work....

    [...]

Patent
28 Jun 2013
TL;DR: In this paper, a delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDO) in SPANs.
Abstract: A Spontaneous Area Network (SPAN) is formed by mobile and fixed nodes using wireless transmission links between nodes, usually in a nearby geographical area. Applications allow users to create, join, leave, and manage SPANs and groups in a SPAN. Automatic procedures allow nodes to join other SPANs. Transmission power of the wireless network interface is dynamic, varying depending on battery level, type of information to transmit, state and topology of the network. A delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDOs). A Patient Transport Protocol (PTP) ensures a reliable transport of information through the network while avoiding congestion conditions. An aggressive and explosive network protocol (AGENET) has routing and forwarding capacities and uses datagrams to establish communication between different nodes of the SPAN. Cooperation and diversity are exploited to react to node mobility that causes frequent changes in network topology and disconnections.

71 citations

Journal Article
TL;DR: In this article, a comprehensive set of simulation results and identifying the key factors that impact TCP's performance over ad-hoc networks are presented. But, the authors focus only on a subset of the affecting factors.
Abstract: In this paper, we study the performance of the transmission control protocol (TCP) over mobile ad-hoc networks. We present a comprehensive set of simulation results and identify the key factors that impact TCP's performance over ad-hoc networks. We use a variety of parameters including link failure detection latency, route computation latency, packet level route unavailability index, and flow level route unavailability index to capture the impact of mobility. We relate the impact of mobility on the different parameters to TCP's performance by studying the throughput, loss-rate and retransmission timeout values at the TCP layer. We conclude from our results that existing approaches to improve TCP performance over mobile ad-hoc networks have identified and hence focused only on a subset of the affecting factors. In the process, we identify a comprehensive set of factors influencing TCP performance. Finally, using the insights gained through the performance evaluations, we propose a framework called Atra consisting of three simple and easily implementable mechanisms at the MAC and routing layers to improve TCP's performance over ad-hoc networks. We demonstrate that Atra improves on the throughput performance of a default protocol stack by 50%-100%.

71 citations

Proceedings ArticleDOI
28 Sep 2002
TL;DR: This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP addresses), which allows the entire packet forwarding operation to be executed within the wireless NIC without the intervention of the host protocol stack.
Abstract: A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP addresses), which allows the entire packet forwarding operation to be executed within the wireless NIC without the intervention of the host protocol stack. Medium access schemes to date, such as IEEE 802.11, have been designed implicitly for either receiving or transmitting a packet, but not for a forwarding operation, i.e. receiving a packet from an upstream node and then immediately transmitting the packet to a downstream node as an atomic channel access operation. This paper proposes a MAC protocol for packet forwarding in multi-hop wireless networks. The proposed protocol builds on the IEEE 802.11 DCF MAC using RTS/CTS and uses MPLS like labels in the control packets (RTS/CTS) to allow the forwarding node to determine the next hop node while contending for the channel. The throughput of this protocol is compared with 802.11 DCF MAC through simulation.

71 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]....

    [...]