A graph-based approach to compute multiple paths in mobile ad hoc networks

  • Authors:
  • Gunyoung Koh;Duyoung Oh;Heekyoung Woo

  • Affiliations:
  • School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Republic of Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Republic of Korea;Division of Information Technology Engineering, Soonchunhyang University, Asan, Republic of Korea

  • Venue:
  • HSI'03 Proceedings of the 2nd international conference on Human.society@internet
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.