Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

HUMAN
2003
Springer

favoriteEmaildiscussreport

179views Social Sciences» more HUMAN 2003»

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

13 years 9 months ago

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

Download popeye.snu.ac.kr

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

Gunyoung Koh, Duyoung Oh, Heekyoung Woo

Real-time Traffic

HUMAN 2003 | Link Disjoint Paths | Multipath On-demand Routing | Multipath Routing |

claim paper

Related Content

» Exploring MultiPath Communication in Hybrid Mobile Ad Hoc Networks

» Analysis of a Distributed Algorithm to Determine Multiple Routes with Path Diversity in Ad...

» AntHocNet An AntBased Hybrid Routing Algorithm for Mobile Ad Hoc Networks

» Capacity and Delay Tradeoffs for AdHoc Mobile Networks

» Reducing EndtoEnd Delay in Multipath Routing Algorithms for Mobile Ad Hoc Networks

» Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks

» Reference Path Ad Hoc Routing Mechanism

» Path set selection in mobile ad hoc networks

» Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	HUMAN
Authors	Gunyoung Koh, Duyoung Oh, Heekyoung Woo

Comments (0)