Comparative performance evaluation of routing protocols for mobile, ad hoc networks
Authors:
- S.R. DasSDS.R. Das
- R. CastanedaRCR. Castaneda
- Jiangtao YanJYJiangtao Yan
- R. SenguptaRSR. Sengupta
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 153-161
Abstract
We evaluate several routing protocols for mobile, wire- less, ad hoc networks via packet level simulations. The pro- tocol suite includes routing protocols specifically design ed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic net- works. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and routing load for a given traffic and mobility model. It is observed that the new generation of on-demand routing protocols use much lower routing load. However, the traditional link state and dis- tance vector protocols provide, in general, better packet d e- livery and delay performance.Keywords
This publication has 15 references indexed in Scilit:
- A cluster-based approach for routing in dynamic networksACM SIGCOMM Computer Communication Review, 1997
- An efficient routing protocol for wireless networksMobile Networks and Applications, 1996
- OSPF Version 21991
- A loop-free extended Bellman-Ford routing protocol without bouncing effect1989
- The revised ARPANET routing metric1989
- A unified approach to loop-free routing using distance vectors or link states1989
- Routing Information Protocol1988
- The DARPA packet radio network protocolsProceedings of the IEEE, 1987
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing TopologyIEEE Transactions on Communications, 1981
- A note on two problems in connexion with graphsNumerische Mathematik, 1959