Disjoint multipath routing to two distinct drains in a multi-drain sensor network

Preetha Thulasiraman, Srinivasan Ramasubramanian, Marwan M Krunz

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

46 Citations (Scopus)

Abstract

Wireless sensor networks (WSN) are typically employed for monitoring applications that require data collection at specific nodes, called drains. In order to improve the robustness of data collection, multiple drains may be employed. Data from every sensor is required to be logged into two distinct sensors for data collection to be resilient to any single drain failures. In this paper, we develop a routing mechanism based on colored trees. Every node forwards the packets based on the drain address and one additional bit. The number of routing table entries at each node is 2|D|, where |D| denotes the number of drains in the network. The construction of the colored trees guarantees that every node has two node-disjoint paths to two distinct drains. The running time complexity of the algorithm is O(|D||L|), where |L| denotes the number of links in the network. Through extensive simulations, we demonstrate that employing multiple drains and disjoint routing to two distinct drains reduces the average path length compared to disjoint routing to one of the multiple drains.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages643-651
Number of pages9
DOIs
StatePublished - 2007
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: May 6 2007May 12 2007

Other

OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
CountryUnited States
CityAnchorage, AK
Period5/6/075/12/07

Fingerprint

Sensor networks
Sensors
Wireless sensor networks
Monitoring

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Thulasiraman, P., Ramasubramanian, S., & Krunz, M. M. (2007). Disjoint multipath routing to two distinct drains in a multi-drain sensor network. In Proceedings - IEEE INFOCOM (pp. 643-651). [4215663] https://doi.org/10.1109/INFCOM.2007.81

Disjoint multipath routing to two distinct drains in a multi-drain sensor network. / Thulasiraman, Preetha; Ramasubramanian, Srinivasan; Krunz, Marwan M.

Proceedings - IEEE INFOCOM. 2007. p. 643-651 4215663.

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

Thulasiraman, P, Ramasubramanian, S & Krunz, MM 2007, Disjoint multipath routing to two distinct drains in a multi-drain sensor network. in Proceedings - IEEE INFOCOM., 4215663, pp. 643-651, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 5/6/07. https://doi.org/10.1109/INFCOM.2007.81
Thulasiraman P, Ramasubramanian S, Krunz MM. Disjoint multipath routing to two distinct drains in a multi-drain sensor network. In Proceedings - IEEE INFOCOM. 2007. p. 643-651. 4215663 https://doi.org/10.1109/INFCOM.2007.81
Thulasiraman, Preetha ; Ramasubramanian, Srinivasan ; Krunz, Marwan M. / Disjoint multipath routing to two distinct drains in a multi-drain sensor network. Proceedings - IEEE INFOCOM. 2007. pp. 643-651
@inproceedings{5461787569034a818db6902bbcc76146,
title = "Disjoint multipath routing to two distinct drains in a multi-drain sensor network",
abstract = "Wireless sensor networks (WSN) are typically employed for monitoring applications that require data collection at specific nodes, called drains. In order to improve the robustness of data collection, multiple drains may be employed. Data from every sensor is required to be logged into two distinct sensors for data collection to be resilient to any single drain failures. In this paper, we develop a routing mechanism based on colored trees. Every node forwards the packets based on the drain address and one additional bit. The number of routing table entries at each node is 2|D|, where |D| denotes the number of drains in the network. The construction of the colored trees guarantees that every node has two node-disjoint paths to two distinct drains. The running time complexity of the algorithm is O(|D||L|), where |L| denotes the number of links in the network. Through extensive simulations, we demonstrate that employing multiple drains and disjoint routing to two distinct drains reduces the average path length compared to disjoint routing to one of the multiple drains.",
author = "Preetha Thulasiraman and Srinivasan Ramasubramanian and Krunz, {Marwan M}",
year = "2007",
doi = "10.1109/INFCOM.2007.81",
language = "English (US)",
isbn = "1424410479",
pages = "643--651",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Disjoint multipath routing to two distinct drains in a multi-drain sensor network

AU - Thulasiraman, Preetha

AU - Ramasubramanian, Srinivasan

AU - Krunz, Marwan M

PY - 2007

Y1 - 2007

N2 - Wireless sensor networks (WSN) are typically employed for monitoring applications that require data collection at specific nodes, called drains. In order to improve the robustness of data collection, multiple drains may be employed. Data from every sensor is required to be logged into two distinct sensors for data collection to be resilient to any single drain failures. In this paper, we develop a routing mechanism based on colored trees. Every node forwards the packets based on the drain address and one additional bit. The number of routing table entries at each node is 2|D|, where |D| denotes the number of drains in the network. The construction of the colored trees guarantees that every node has two node-disjoint paths to two distinct drains. The running time complexity of the algorithm is O(|D||L|), where |L| denotes the number of links in the network. Through extensive simulations, we demonstrate that employing multiple drains and disjoint routing to two distinct drains reduces the average path length compared to disjoint routing to one of the multiple drains.

AB - Wireless sensor networks (WSN) are typically employed for monitoring applications that require data collection at specific nodes, called drains. In order to improve the robustness of data collection, multiple drains may be employed. Data from every sensor is required to be logged into two distinct sensors for data collection to be resilient to any single drain failures. In this paper, we develop a routing mechanism based on colored trees. Every node forwards the packets based on the drain address and one additional bit. The number of routing table entries at each node is 2|D|, where |D| denotes the number of drains in the network. The construction of the colored trees guarantees that every node has two node-disjoint paths to two distinct drains. The running time complexity of the algorithm is O(|D||L|), where |L| denotes the number of links in the network. Through extensive simulations, we demonstrate that employing multiple drains and disjoint routing to two distinct drains reduces the average path length compared to disjoint routing to one of the multiple drains.

UR - http://www.scopus.com/inward/record.url?scp=34548337322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548337322&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2007.81

DO - 10.1109/INFCOM.2007.81

M3 - Conference contribution

AN - SCOPUS:34548337322

SN - 1424410479

SN - 9781424410477

SP - 643

EP - 651

BT - Proceedings - IEEE INFOCOM

ER -