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

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

• Type: Conference
• Year: 2003
• Where: HUMAN
• Authors: Gunyoung Koh, Duyoung Oh, Heekyoung Woo
• Keywords: HUMAN 2003, Link Disjoint Paths, Multipath On-demand Routing, Multipath Routing