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 work distinguishes between neighbor discovery during sensor network initialization and continuous neighbor discovery, and focuses on the latter and view it as a joint task of all the nodes in every connected segment.
Abstract: In most sensor networks, the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process we call continuous neighbor discovery. In this work, we distinguish between neighbor discovery during sensor network initialization and continuous neighbor discovery. We focus on the latter and view it as a joint task of all the nodes in every connected segment. Each sensor employs a simple protocol in a coordinate effort to reduce power consumption without increasing the time required to detect hidden sensors.
61 citations
TL;DR: A novel Q-learning based Multi-objective optimization Routing protocol for FANETs to provide low-delay and low-energy service guarantees and a new exploration and exploitation mechanism is proposed to explore some undiscovered potential optimal routing path while exploiting the acquired knowledge.
61 citations
TL;DR: A novel solution is proposed to handle DDoS attacks in mobile ad hoc networks (MANETs) because of the properties of ad hoc network such as dynamic topologies, low battery life, multicast routing, frequency of updates or network overhead, scalability, mobile agent based routing, and power aware routing.
Abstract: Distributed Denial of Service (DDoS) attacks in the
networks needs to be prevented or handled if it occurs, as early as possible
and before reaching the victim. Dealing with DDoS attacks is difficult due to
their properties such as dynamic attack rates, various kinds of targets, big
scale of botnet, etc. Distributed Denial of Service (DDoS) attack is hard to deal
with because it is difficult to distinguish legitimate traffic from malicious
traffic, especially when the traffic is coming at a different rate from
distributed sources. DDoS attack becomes more difficult to handle if it occurs
in wireless network because of the properties of ad hoc network such as dynamic
topologies, low battery life, multicast routing, frequency of updates or
network overhead, scalability, mobile agent based routing, and power aware
routing, etc. Therefore, it is better to prevent the distributed denial of
service attack rather than allowing it to occur and then taking the necessary
steps to handle it. This paper discusses various the attack mechanisms and
problems due to DDoS attack, also how MANET can be affected by these attacks. In
addition to this, a novel solution is proposed to handle DDoS attacks in mobile
ad hoc networks (MANETs).
61 citations
Cites background from "Ad hoc On-Demand Distance Vector (A..."
...Once the RREQ reaches the destination or an intermediate node with a fresh route to the destination is located, the destination or the intermediate node will send a route reply (RREP) packet back to the source along the reverse routing path [42]....
[...]
...Figure 5 shows the categorization of various mobile ad hoc network routing protocols and their subtypes [42]....
[...]
02 Mar 2009
TL;DR: Simulation results show that node placement model plays as important role in simulation outcome as the accuracy of wireless signal propagation model, and the importance of node placement algorithm is demonstrated.
Abstract: Despite a considerable number of topology generation algorithms for simulation of wireless multihop networks it is difficult to find one with output similar to real networks.
We propose NPART --- a Node Placement Algorithm for Realistic Topologies whose output topologies resemble networks encountered in reality. The algorithm is flexible since it is sufficient to provide it with different input data to obtain different topologies. To demonstrate its quality, we compare topologies generated by NPART algorithm with our measurements from open wireless multihop networks in Berlin and Leipzig. Compared with real topologies, the generated topologies have almost identical node degree distribution, similar number of cut-edges and vertices, and distribution of component sizes after bridge removal.
The importance of node placement algorithm is demonstrated by comparing ns-2 simulation results for grid and uniform node placement with NPART generated topologies. Simulation results show that node placement model plays as important role in simulation outcome as the accuracy of wireless signal propagation model.
61 citations
Cites methods from "Ad hoc On-Demand Distance Vector (A..."
...NPART algorithm generates 275-node topologies, using data input from Berlin’s network and combined metric (s=1, p=5). Routing protocol is AODV [ 15 ]....
[...]
01 Jan 2006
TL;DR: In this article, the authors introduce two full functional identity-based authentication and key exchange (IDAKE) schemes for mobile ad hoc networks (MANETs) and provide a security and performance discussion of the presented MANET-IDAKE schemes and IDAKE protocol.
Abstract: In this work, we introduce two full functional identity-based authentication and key exchange (IDAKE) schemes for mobile ad hoc networks (MANETs). Therefore, we utilize some special features of identity-based cryptographic (IBC) schemes, such as pre-shared secret keys from pairings and efficient key management, to design MANET-IDAKE schemes that meet the special constraints and requirements of MANETs. As part of these schemes, we present the first key revocation and key renewing algorithms for IBC schemes. The former algorithm uses a new concept of neighborhood watch. We introduce a basic MANET-IDAKE scheme in which a trusted third party (TTP) initializes all devices before they join the network and a fully self-organized MANET-IDAKE scheme that does not require any central TTP. The schemes bootstrap the security in MANETs and enable the use of authentication, key exchange, and other security protocols in a variety of applications. Furthermore, we present an extremely efficient yet secure IDAKE protocol that can be used in the presented schemes. Finally, we provide a security and performance discussion of the presented MANET-IDAKE schemes and IDAKE protocol.
61 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]....
[...]