TY - GEN
T1 - Disjoint multipath routing in dual homing networks using colored trees
AU - Thulasiraman, Preetha
AU - Ramasubramanian, Srinivasan
AU - Krunz, Marwan
PY - 2006
Y1 - 2006
N2 - 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 improve robustness in data collection, we consider a dual homing network in which two drains are employed and every node is required to send data to the two drains over link- or node-disjoint paths. One approach to reduce the number of routing table entries at a node is to construct two trees, namely red and blue, each rooted at a particular drain such that the paths from any node to the two drains on the trees are link- or node-disjoint. In this paper, we develop the first distributed algorithm for constructing colored trees in a dual-homing network whose running time is linear in the number of links. In addition, we show that the average path length may be optimized by employing the generalized low-point concept rather than the traditional low-point concept.
AB - 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 improve robustness in data collection, we consider a dual homing network in which two drains are employed and every node is required to send data to the two drains over link- or node-disjoint paths. One approach to reduce the number of routing table entries at a node is to construct two trees, namely red and blue, each rooted at a particular drain such that the paths from any node to the two drains on the trees are link- or node-disjoint. In this paper, we develop the first distributed algorithm for constructing colored trees in a dual-homing network whose running time is linear in the number of links. In addition, we show that the average path length may be optimized by employing the generalized low-point concept rather than the traditional low-point concept.
UR - http://www.scopus.com/inward/record.url?scp=50949133642&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50949133642&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2006.996
DO - 10.1109/GLOCOM.2006.996
M3 - Conference contribution
AN - SCOPUS:50949133642
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -