2003 | OriginalPaper | Chapter
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Authors : Gunyoung Koh, Duyoung Oh, Heekyoung Woo
Published in: Web and Communication Technologies and Internet-Related Social Issues — HSI 2003
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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