Disjoint multipath routing in dual homing networks using colored trees

Preetha Thulasiraman, Srinivasan Ramasubramanian, Marwan Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Scopus citations

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 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.

Original languageEnglish (US)
Title of host publicationIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
DOIs
StatePublished - 2006
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: Nov 27 2006Dec 1 2006

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

OtherIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Country/TerritoryUnited States
CitySan Francisco, CA
Period11/27/0612/1/06

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Disjoint multipath routing in dual homing networks using colored trees'. Together they form a unique fingerprint.

Cite this