Abstract
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery process. We propose Graph-based Multipath Routing (GMR), a novel multipath routing protocol that generate the network topology graph to compute all link disjoint paths in the network. The destination node computes link disjoint paths using the local graph search algorithm. We present our simulation results compared with DSR and Multipath DSR
This work was supported by Samsung Electronics and the University IT Research Supporting Program under the Ministry of Information and Communication of Korea
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.E. Perkins and P. Bhagwat.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In Proceedings of the ACM SIGCOMM (1994) 234–244
D. Johnson and D. Maltz.: Dynamic Source Routing in Ad Hoc Wireless Networks. In T. Imielinski and H. Korth, editors, Mobile computing, chapter 5. Kluwer Academic (1996)
V.D. Park and M. S. Corson.: A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proceedings of the INFOCOM (1997) 1405–1413
C.E. Perkins and E.M. Royer.: Ad Hoc On-Demand Distance-Vector Routing. In Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (1999) 90–100
J. Broch, D. Maltz, D. Johnson, Y.C. Hu, and J. Jetcheva.: A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proceedings of the IEEE/ACM MOBICOM (1998) 85–97
B. Williams and T. Camp.: Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks. In Proceedings of the ACM MOBIHOC (2002) 253–264
A. Nasipuri, R. Castaneda, and S.R. Das.: Performance of Multipath Routing for On-demand Protocols in Mobile Ad Hoc Networks. ACM/Kluwer Mobile Networks and Applications (MONET) (2001) 6(4):339–349
S. J. Lee and M. Gerla.: Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks. In Proceedings of the IEEE ICC (2001) 3201–3205
M.K. Marina and S. R. Das.: On-demand Multipath Distance Vector Routing in Ad Hoc Networks. In Proceedings of the International Conference for Network Protocols (ICNP) (2001) 14–23
Charu C. Aggarwal and James B. Orlin.: On Multi-route Maximum Flows in Networks. Networks N39 (2002) 43–52
K. Fall and K. Varadhan.: ns notes and documentation, December 2000. Available from http://www.isi.edu/nsnam/ns/
The CMU Monarch Group: Wireless and Mobility Extensions to ns-2. Available from http://www.monarch.cs.cmu.edu/cmu-ns.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koh, G., Oh, D., Woo, H. (2003). A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks. In: Chung, CW., Kim, CK., Kim, W., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues — HSI 2003. HSI 2003. Lecture Notes in Computer Science, vol 2713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45036-X_33
Download citation
DOI: https://doi.org/10.1007/3-540-45036-X_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40456-9
Online ISBN: 978-3-540-45036-8
eBook Packages: Springer Book Archive