Selecting a routing strategy for your ad hoc network

Cited 21 time in webofscience Cited 34 time in scopus
  • Hit : 311
  • Download : 0
In this paper we investigate the performance of routing strategies in ad hoc networks. An ad hoc network operates without a central entity or infrastructure, and is composed of highly mobile network hosts. In this environment, routes tend to be multihop and routing protocols are faced with host mobility and bandwidth constraints. In recent years, numerous routing protocols of different styles have been proposed. Traditional table-driven protocols (distance vector, link state), reactive on-demand protocols, and location-based protocols that use position information provided by GPS are the most commonly used strategies. Using PARSEC, we simulate protocols that represent these various routing strategies. The protocols are evaluated in different network scenarios. Relative strengths, weaknesses, and applicability to various situations of each routing protocol are studied and discussed. (C) 2002 Published by Elsevier Science B.V.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2003-05
Language
English
Article Type
Article
Citation

COMPUTER COMMUNICATIONS, v.26, no.7, pp.723 - 733

ISSN
0140-3664
DOI
10.1016/S0140-3664(02)00207-4
URI
http://hdl.handle.net/10203/198348
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 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0