Ad hoc On-Demand Distance Vector (AODV) Routing
- C. Perkins, E. Belding-Royer, Samir R Das
- PhysicsRequest for Comments
- 12 November 2001
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.
Ad-hoc on-demand distance vector routing
- C. Perkins, E. Belding-Royer
- Computer ScienceProceedings WMCSA'99. Second IEEE Workshop on…
- 25 February 1999
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
A review of current routing protocols for ad hoc mobile wireless networks
- E. Belding-Royer, C. Toh
- Computer ScienceIEEE wireless communications
- 1 April 1999
Routing protocols for ad hoc networks are examined by providing an overview of eight different protocols by presenting their characteristics and functionality, and then a comparison and discussion of their respective merits and drawbacks are provided.
A secure routing protocol for ad hoc networks
- K. Sanzgiri, B. Dahill, B. Levine, C. Shields, E. Belding-Royer
- Computer Science10th IEEE International Conference on Network…
- 1 July 2002
This work details security threats against ad hoc routing protocols, specifically examining AODV and DSR, and proposes a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected.
Multicast operation of the ad-hoc on-demand distance vector routing protocol
- E. Belding-Royer, C. Perkins
- Computer ScienceACM/IEEE International Conference on Mobile…
- 1 August 1999
Ad-hoc On-Demand Distance Vector Routing is extended to offer novel multicast capabilities which follow naturally from the way AODV establishes unicast routes.
Performance comparison of two on-demand routing protocols for ad hoc networks
- Samir R Das, C. Perkins, E. Belding-Royer
- Computer ScienceProceedings IEEE INFOCOM . Conference on Computer…
- 26 March 2000
It is demonstrated that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials.
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks
- K. Ramachandran, E. Belding-Royer, K. Almeroth, M. Buddhikot
- Business, Computer ScienceProceedings IEEE INFOCOM . 25TH IEEE…
- 23 April 2006
This paper presents an interference-aware channel assignment algorithm and protocol for multi-radio wireless mesh networks that address this interference problem and demonstrates its practicality through the evaluation of a prototype implementation in a IEEE 802.11 testbed.
An analysis of the optimum node density for ad hoc mobile networks
- E. Belding-Royer, P. Melliar-Smith, L. Moser
- Computer ScienceICC . IEEE International Conference on…
- 11 June 2001
It is shown that there does not exist a global optimum density, but rather that, to achieve this maximum, the node density should increase as the rate of node movement increases.
AODV routing protocol implementation design
- I. Chakeres, E. Belding-Royer
- Computer Science24th International Conference on Distributed…
- 23 March 2004
The event triggers required for AODV operation, the design possibilities and the decisions for the ad hoc on-demand distance vector routing protocol implementation, A ODV-UCSB are described.
Authenticated routing for ad hoc networks
- K. Sanzgiri, D. LaFlamme, B. Dahill, B. Levine, C. Shields, E. Belding-Royer
- Computer ScienceIEEE Journal on Selected Areas in Communications
- 7 March 2005
This paper describes and evaluates ARAN and shows that it is able to effectively and efficiently discover secure routes within an ad hoc network, and details how ARAN can secure routing in environments where nodes are authorized to participate but untrusted to cooperate, as well as environments where participants do not need to be authorization to participate.
...
...