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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Koh, G., Oh, D., & Woo, H. (2003). A graph-based approach to compute multiple paths in mobile ad hoc networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2713, 323–331. https://doi.org/10.1007/3-540-45036-x_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
