Fault-tolerant design of wireless sensor networks with directional antennas

Shahrzad Shirazipourazad, Arunabha Sen, Subir Bandyopadhyay

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A tree structure is often used in wireless sensor networks to deliver sensor data to a sink node. Such a tree can be built using directional antennas as they offer considerable advantage over the omni-directional ones. A tree is adequate for data gathering from all sensor nodes if no node fails. We study the problem of enhancing the fault tolerance of a data gathering tree by adding additional links so that failure of a sensor or a pair of adjacent sensors would not disconnect the tree. We prove that the least-cost tree augmentation problem is NP-complete and provide approximation algorithms one for single node failure and the other for a pair of adjacent node failure, with performance bounds of two and four respectively.

Original languageEnglish (US)
Pages (from-to)258-271
Number of pages14
JournalPervasive and Mobile Computing
Volume13
DOIs
StatePublished - 2014

Fingerprint

Directional Antenna
Fault-tolerant
Wireless Sensor Networks
Wireless sensor networks
Antennas
Sensors
Vertex of a graph
Sensor
Approximation algorithms
Fault tolerance
Sensor nodes
Adjacent
Computational complexity
Performance Bounds
Augmentation
Tree Structure
Fault Tolerance
Approximation Algorithms
NP-complete problem
Design

Keywords

  • Directional antenna
  • Region based fault
  • Tree connectivity augmentation problem

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Applied Mathematics

Cite this

Fault-tolerant design of wireless sensor networks with directional antennas. / Shirazipourazad, Shahrzad; Sen, Arunabha; Bandyopadhyay, Subir.

In: Pervasive and Mobile Computing, Vol. 13, 2014, p. 258-271.

Research output: Contribution to journalArticle

Shirazipourazad, Shahrzad ; Sen, Arunabha ; Bandyopadhyay, Subir. / Fault-tolerant design of wireless sensor networks with directional antennas. In: Pervasive and Mobile Computing. 2014 ; Vol. 13. pp. 258-271.
@article{78138a6a08594134b1a92071f70ea8b5,
title = "Fault-tolerant design of wireless sensor networks with directional antennas",
abstract = "A tree structure is often used in wireless sensor networks to deliver sensor data to a sink node. Such a tree can be built using directional antennas as they offer considerable advantage over the omni-directional ones. A tree is adequate for data gathering from all sensor nodes if no node fails. We study the problem of enhancing the fault tolerance of a data gathering tree by adding additional links so that failure of a sensor or a pair of adjacent sensors would not disconnect the tree. We prove that the least-cost tree augmentation problem is NP-complete and provide approximation algorithms one for single node failure and the other for a pair of adjacent node failure, with performance bounds of two and four respectively.",
keywords = "Directional antenna, Region based fault, Tree connectivity augmentation problem",
author = "Shahrzad Shirazipourazad and Arunabha Sen and Subir Bandyopadhyay",
year = "2014",
doi = "10.1016/j.pmcj.2014.03.004",
language = "English (US)",
volume = "13",
pages = "258--271",
journal = "Pervasive and Mobile Computing",
issn = "1574-1192",
publisher = "Elsevier",

}

TY - JOUR

T1 - Fault-tolerant design of wireless sensor networks with directional antennas

AU - Shirazipourazad, Shahrzad

AU - Sen, Arunabha

AU - Bandyopadhyay, Subir

PY - 2014

Y1 - 2014

N2 - A tree structure is often used in wireless sensor networks to deliver sensor data to a sink node. Such a tree can be built using directional antennas as they offer considerable advantage over the omni-directional ones. A tree is adequate for data gathering from all sensor nodes if no node fails. We study the problem of enhancing the fault tolerance of a data gathering tree by adding additional links so that failure of a sensor or a pair of adjacent sensors would not disconnect the tree. We prove that the least-cost tree augmentation problem is NP-complete and provide approximation algorithms one for single node failure and the other for a pair of adjacent node failure, with performance bounds of two and four respectively.

AB - A tree structure is often used in wireless sensor networks to deliver sensor data to a sink node. Such a tree can be built using directional antennas as they offer considerable advantage over the omni-directional ones. A tree is adequate for data gathering from all sensor nodes if no node fails. We study the problem of enhancing the fault tolerance of a data gathering tree by adding additional links so that failure of a sensor or a pair of adjacent sensors would not disconnect the tree. We prove that the least-cost tree augmentation problem is NP-complete and provide approximation algorithms one for single node failure and the other for a pair of adjacent node failure, with performance bounds of two and four respectively.

KW - Directional antenna

KW - Region based fault

KW - Tree connectivity augmentation problem

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

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

U2 - 10.1016/j.pmcj.2014.03.004

DO - 10.1016/j.pmcj.2014.03.004

M3 - Article

VL - 13

SP - 258

EP - 271

JO - Pervasive and Mobile Computing

JF - Pervasive and Mobile Computing

SN - 1574-1192

ER -