Abstract
In this paper,we compare the performance of two on-demand and one pro-active algorithms for multi-hop,ad hoc networks and variants of the algorithms.We showthat on-demand algorithms react well to transient conditions such as high node mobility in combination with low network load,but are unlikely to provide the best performance under heavy network loads.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boppana, R.V., Marina, M.K., Konduru, S.P.: An analysis of routing techniques for mobile and ad hoc networks (June 1999) (manuscript) , http://www.cs.utsa.edu/faculty/boppana/papers/papers.htm
Broch, J., et al.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: ACM Mobicom 1998 (October 1998)
Cheng, C., Riley, R., Kumar, S.P.R.: A loop-free extended Bellman-Ford routing protocol without bouncing effect. In: ACM SIGCOMM 1989, pp. 224–236 (1989)
CMU Monarch Group, CMU Monarch extensions to the NS-2 simulator (1998), Available from http://monarch.cs.cmu.edu/cmu-ns.html
Comer, D.E. (ed.): Internetworking with TCP/IP, vol. 1. Prentice Hall, Inc., Englewood Cliffs (1995)
Das, S.R., Castaneda, R., Yan, J.: Simulation based performance evaluation of mobile, ad hoc network routing protocols. In: Seventh Int’l Conf. on Computer Communication and Networks (October 1998)
Fall, K., Varadhan, K.: NS notes and documentation. The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC (November 1997), Available from http://wwwmash.cs.berkeley.edu/ns
Garcia-Luna-Aceves, J.J.: A unified approach to loop-free routing using distance vectors or link states. In: ACM SIGCOMM 1989, pp. 212–223 (1989)
Hedrick, C.: Routing information protocol. RFC 1058 (1988)
Johnson, D.B., et al.: The dynamic source routing protocol for mobile adhoc networks. IETF Internet Draft (1999), http://www.ietf.org/internet-drafts/draft-ietfmanet-dsr-02.txt
Moy, J.: Ospf version 2. RFC 1247 (July 1991)
Park, V.D., Corson, S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: IEEE INFOCOM 1997, pp. 1405–1413 (April 1997)
Perins, C.E., Bhagwat, P.: Highly dynamic destination-sequenced distance vector (DSDV) for mobile computer. In: ACM SIGCOMM 1994, pp. 234–244 (August 1994)
Perkins, C.E.: Ad hoc on demand distance vector routing. IETF Internet Draft (1997), http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-02.txt
Perkins, C.E., Royer, E.M., Das, S.R.: Ad hoc on demand distance vector routing. IETF Internet Draft (1999), http://www.ietf.org/internet-drafts/draft-ietfmanet-aodv-03.txt
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boppana, R.V., Marina, M.K., Konduru, S.P. (1999). An Analysis of Routing Techniques for Mobile and Ad Hoc Networks. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive