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
01 Jun 2008
TL;DR: This paper presents a mechanism capable of detecting and accusing nodes that exhibit packet forwarding misbehavior, and demonstrates that the algorithm effectively detects and accuses nodes that drop a significant fraction of packets.
Abstract: Mobile Ad Hoc networks (MANETs) are susceptible to having their effective operation compromised by a variety of security attacks. For example, misbehaving nodes can cause general network disruption by not forwarding packets on behalf of other nodes in the network. Nodes may misbehave either because they are malicious and deliberately wish to disrupt the network, or because they are selfish and wish to conserve their own limited resources such as power, or for other reasons. In this paper, we present a mechanism capable of detecting and accusing nodes that exhibit packet forwarding misbehavior. Our evaluation results demonstrate that our algorithm effectively detects and accuses nodes that drop a significant fraction of packets.

57 citations


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

  • ...This paper does not address security measures for our misbehavior detection and accusation approach since it focuses on the basic proposal of misbehavior and detection mechanisms....

    [...]

  • ...WATCHERS (Watching for Anomalies in Transit Conservation: a Heuristic for Ensuring Router Security) [25] is a protocol designed to detect disruptive routers in fixed networks through analysis of the number of packets entering and exiting a router....

    [...]

Proceedings ArticleDOI
02 May 2007
TL;DR: By implementing and evaluating the open BAS standard BACnet on resource-constrained sensor nodes, it is shown that integrating existing standard BAS protocols with wireless sensor networks is feasible.
Abstract: Building automation systems (BAS) are used to control and improve indoor building climate at reduced costs. By integrating BAS with wireless sensor networks, the need for cabling can be removed, and both installation and operational costs significantly reduced. Furthermore, temporary BAS installations are made possible. By implementing and evaluating the open BAS standard BACnet on resource-constrained sensor nodes we show that integrating existing standard BAS protocols with wireless sensor networks is feasible.

57 citations

Journal ArticleDOI
TL;DR: The average packet delivery ratio in the network under a hop count limitation can be estimated accurately, and the tradeoff between the flooding cost and the search latency for target location discovery that is commonly used in many ad hoc routing protocols can also be evaluated.
Abstract: The significance of hop counts on the throughput and delay performance in multihop wireless networks has been well demonstrated in the literature However, so far, there has been very little analytical work on determining the expected hop count for packet forwarding in multihop wireless networks In this paper, we develop an analytical framework for the hop count distribution in a multihop wireless network with an arbitrary node density We derive the average progress per hop and obtain the path connectivity probability in a network Together with the derived per-hop progress and the path connectivity probability, we can express the probability distribution for the expected hop count in multihop wireless networks We also demonstrate that, based on our analytical result, many network design guidelines can be provided Specifically, the average packet delivery ratio in the network under a hop count limitation can be estimated accurately, and the tradeoff between the flooding cost and the search latency for target location discovery that is commonly used in many ad hoc routing protocols can also be evaluated

57 citations


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

  • ...The searching packet for target location in ad hoc on demand distance vector routing [ 15 ] is an example....

    [...]

Journal ArticleDOI
TL;DR: The current state of research for QoS support in TDMA-based MANETs at different layers of the networking model is presented and categorized and the current issues and future challenges involved in this exciting area of research are included.
Abstract: Mobile ad hoc networks (MANETs) are gaining a lot of attention in research lately due to their importance in enabling mobile wireless nodes to communicate without any existing wired or predetermined infrastructures. Furthermore, in order to support the growing need for multimedia and realtime applications, quality of service (QoS) support by the networking protocol is required. Several important QoS parameters that are needed by such applications can be identified. They include bandwidth, end-to-end delay, delay jitter, and bit error rate. A good amount of research has been developed in this area covering different issues and challenges such as developing routing protocols that support bandwidth reservation and delay management. In this paper, the current state of research for QoS support in TDMA-based MANETs at different layers of the networking model is presented and categorized. In addition, the current issues and future challenges involved in this exciting area of research are also included.

57 citations

Journal Article
TL;DR: This work proposes and simulates two new adaptive gateway discovery algorithms based on the dynamic adjustment of the scope of the gateway advertisement packets and shows that the adaptation capabilities of these schemes allow them to outperform existing mechanisms over a variety of scenarios and mobility rates.
Abstract: One of the key overhead components affecting the overall performance of hybrid ad hoc networks is the discovery and selection of Internet gateways. We develop an analytical model to evaluate existing proposals and we show that each of them is suited only for a limited range of network conditions. We propose and simulate two new adaptive gateway discovery algorithms (maximal source coverage and maximal benefit coverage) based on the dynamic adjustment of the scope of the gateway advertisement packets. Our results show that the adaptation capabilities of our proposed schemes allow them to outperform existing mechanisms over a variety of scenarios and mobility rates.

57 citations


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

  • ...These properties are making them a very attractive component in future mobile and wireless network architectures....

    [...]

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

    [...]