A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks

@article{Lee1999ASS,
  title={A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks},
  author={Sung-Ju Lee and Mario Gerla and Chai K. Toh},
  journal={IEEE Netw.},
  year={1999},
  volume={13},
  pages={48-54}
}
Bandwidth and power constraints are the main concerns in current wireless networks because multihop ad hoc mobile wireless networks rely on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power, and computation demands on mobile hosts which must be taken into account when choosing the best routing protocol. In previous years, protocols that build routes based on demand have been proposed. The major goal of on-demand routing protocols is to… 
View via Publisher
nrlweb.cs.ucla.edu
249 Citations
Highly Influential Citations
6
Background Citations
96
Methods Citations
22
Results Citations
3

249 Citations

Citation Type

Citation Type

Routing and multicasting strategies in wireless mobile ad hoc networks
TLDR
This study shows that on-demand protocols are better suited for mobile networks because they generate less control overhead and manage the mobility in a more efficient manner and presents the On-Demand Multicast Routing Protocol, a novel multicasting scheme that utilizes a mesh structure.
A performance comparison of multi on-demand routing in wireless ad hoc networks
TLDR
Simulation-based comparison of on-demand routing protocols in multi ad hoc networks shows that throughput for AODV is better than both DSR and TORA by 50%.
Adaptive multi-path on-demand routing in mobile ad hoc networks
TLDR
The results show that AMOR outperforms the traditional dynamic source routing algorithm, and the control traffic overhead in AMOR is comparable to that of single-path on-demand protocols.
A Novel Routing Protocol for Supporting QoS for Ad Hoc Mobile Wireless Networks
TLDR
The goal of this article is to discover an optimal rout with minimum time delay for transmitting real-time data from a source node hop by hop to adestination node under some predefined constraints.
A stability-based multipath routing algorithm for ad hoc networks
TLDR
This work analysis of the multipath's stability shows that the stability of multipath routing is closely related to the routing policies and an independent stability-based routing scheme that is based on DSR is presented together with the utilization of a group of independent paths for routing.
An Efficient Routing Protocol for Wireless Ad hoc Networks
TLDR
It was shown that the unique route discovery mechanism of the ODLW outperformed Dynamic Source Routing protocol (DSR) and Optimized Link State Routing Protocol (OLSR) in reducing the end-to-end delay as well as the packet drop.
A stability-based distributed routing mechanism to support unicast and multicast routing in ad hoc wireless network
Simulation and performance analysis of the AD HOC On-Demand Distance Vector Routing Protocol for tactical mobile ad hoc networks
TLDR
Simulation and analysis of the Ad Hoc On-Demand Distance Vector Routing Protocol for mobile ad hoc network (MANET) environments using the Network Simulator 2 (NS2) tool indicate that the network environment size, packet rate and offered load are critical to the network performance.
A Comparative Study on Reactive or On Demand Routing Protocols in Mobile Ad Hoc Networks
TLDR
Various Reactive or On Demand routing protocols for Mobile Ad hoc network, which aims at efficient route establishment between any given pair of nodes, are presented.
On the Evaluation and Classification of Routing Protocols for Mobile Ad Hoc Networks
TLDR
This dissertation analyses evaluation techniques from the past and describes common problems with simulation based evaluation of routing protocols for MANETs and how to resolve them.
...
...

References

SHOWING 1-10 OF 42 REFERENCES
A novel distributed routing protocol to support ad-hoc mobile computing
  • C. Toh
  • Computer Science, Business
    Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications
  • 1996
TLDR
A new associativity-based routing scheme where a route is selected based on nodes having associativity states that imply periods of stability, resulting in higher attainable throughput and the integration of ad-hoc routing into a BS-oriented wireless LAN environment, providing fault tolerance in times of base station failures.
Associativity-Based Routing for Ad Hoc Mobile Networks
  • C. Toh
  • Computer Science, Business
    Wirel. Pers. Commun.
  • 1997
TLDR
A new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment that is free from loops, deadlock and packet duplicates and has scalable memory requirements is presented.
A review of current routing protocols for ad hoc mobile wireless networks
TLDR
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.
Ad-hoc on-demand distance vector routing
  • C. Perkins, E. Belding-Royer
  • Computer Science
    Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
TLDR
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.
Dynamic Source Routing in Ad Hoc Wireless Networks
TLDR
This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
A distributed routing algorithm for mobile wireless networks
TLDR
A loop-free, distributed routing protocol for mobile packet radio networks intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow to make one of the existing protocols for a nearly-static topology applicable.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TLDR
This paper investigates modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP, to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks.
Signal stability-based adaptive routing (SSA) for ad hoc mobile networks
TLDR
A distributed adaptive routing protocol for finding and maintaining stable routes based on signal strength and location stability in an ad hoc network is proposed and an architecture for its implementation is presented.
ABAM: on-demand associativity-based multicast routing for ad hoc mobile networks
  • C. Toh, G. Guichal, S. Bunchua
  • Business, Computer Science
    Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152)
  • 2000
TLDR
A performance evaluation of a novel multicast routing strategy for a mobile ad hoc network environment, which is characterized by a highly-dynamic topology with constrained bandwidth and limited power.
An efficient routing protocol for wireless networks
TLDR
WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.
...
...