Sciweavers

31 search results - page 1 / 7
» Disjoint multipath routing using colored trees
Sort
View
CN
2007
154views more  CN 2007»
13 years 4 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
GLOBECOM
2006
IEEE
13 years 11 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...
HUMAN
2003
Springer
13 years 10 months ago
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 proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
LCN
2008
IEEE
13 years 11 months ago
Spatially Disjoint Multipath Routing protocol without location information
—Multipath routing permits the discovery and use of multiple paths between a source and a destination. We develop a distributed on-demand multipath routing protocol for MANETs ca...
Juan Jose Galvez, Pedro M. Ruiz, Antonio F. G&oacu...
CJ
2011
12 years 8 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman