By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sung-Ju Lee ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; Gerla, M. ; Chai-Keong Toh

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 minimize control traffic overhead. We perform a simulation and performance study on some routing protocols for ad hoc networks. The distributed Bellman-Ford (1957, 1962), a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless network. In addition, two on-demand routing protocols (dynamic source routing and associativity-based routing) with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and contrast their performance. The final selection of an appropriate protocol will depend on a variety of factors, which are discussed in this article

Published in:

Network, IEEE  (Volume:13 ,  Issue: 4 )