Skip to main content
SpringerLink
Log in

A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks

  • Conference paper
  • First Online:
Web and Communication Technologies and Internet-Related Social Issues — HSI 2003 (HSI 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2713))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. 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)

    Google Scholar 

  3. 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

    Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Google Scholar 

  6. B. Williams and T. Camp.: Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks. In Proceedings of the ACM MOBIHOC (2002) 253–264

    Google Scholar 

  7. 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

    Article  MATH  Google Scholar 

  8. 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

    Google Scholar 

  9. 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

    Google Scholar 

  10. Charu C. Aggarwal and James B. Orlin.: On Multi-route Maximum Flows in Networks. Networks N39 (2002) 43–52

    Article  MathSciNet  Google Scholar 

  11. K. Fall and K. Varadhan.: ns notes and documentation, December 2000. Available from http://www.isi.edu/nsnam/ns/

  12. The CMU Monarch Group: Wireless and Mobility Extensions to ns-2. Available from http://www.monarch.cs.cmu.edu/cmu-ns.html

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Republic of Korea

    Gunyoung Koh & Duyoung Oh

  2. Division of Information Technology Engineering, Soonchunhyang University, Asan, Republic of Korea

    Heekyoung Woo

Authors
  1. Gunyoung Koh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Duyoung Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heekyoung Woo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Computer Science, Korea Advanced Institute of Science and Technology, 373-1 Guseong-Dong, Yuseong-Gu, Daejeon, 305-701, Korea

    Chin-Wan Chung

  2. Dept. of Computer Engineering, Seoul National University, San 56-1, Shillim-Dong, Gwanak-Gu, Seoul, 151-742, Korea

    Chong-Kwon Kim

  3. Cyber Database Solutions, Inc., 3445 Executive Center Drive, Suite 256, TX, 78731, USA

    Won Kim

  4. Dept. of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore, 117543

    Tok-Wang Ling

  5. Korea Network Information Center, 11F, KTF B/D 1321-11, Seocho2-Dong, Seocho-Gu, Seoul, 137-857, Korea

    Kwan-Ho Song

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation