Fault-tolerant design of wireless sensor networks with directional antennas

Shahrzad Shirazipourazad; Arunabha Sen; Subir Bandyopadhyay

doi:10.1016/j.pmcj.2014.03.004

Fault-tolerant design of wireless sensor networks with directional antennas

Shahrzad Shirazipourazad, Arunabha Sen, Subir Bandyopadhyay

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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 language	English (US)
Pages (from-to)	258-271
Number of pages	14
Journal	Pervasive and Mobile Computing
Volume	13
DOIs	https://doi.org/10.1016/j.pmcj.2014.03.004
State	Published - Aug 2014

Keywords

Directional antenna
Region based fault
Tree connectivity augmentation problem

ASJC Scopus subject areas

Software
Information Systems
Hardware and Architecture
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1016/j.pmcj.2014.03.004

Cite this

@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",

month = aug,

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/8

Y1 - 2014/8

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

AN - SCOPUS:84904690871

SN - 1574-1192

VL - 13

SP - 258

EP - 271

JO - Pervasive and Mobile Computing

JF - Pervasive and Mobile Computing

ER -

Fault-tolerant design of wireless sensor networks with directional antennas

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this