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

Cited 78 time in webofscience Cited 139 time in scopus
  • Hit : 189
  • Download : 0
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 rooter 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 recent 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. In this article we perform a simulation and performance study on some routing protocols for ad hoc networks. Distributed Bellman-Ford, a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless networks. 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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1999-07
Language
English
Article Type
Article
Citation

IEEE NETWORK, v.13, no.4, pp.48 - 54

ISSN
0890-8044
DOI
10.1109/65.777441
URI
http://hdl.handle.net/10203/198353
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 78 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0