TY - GEN

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

AU - Shirazipourazad, Shahrzad

AU - Sen, Arunabha

AU - Bandyopadhyay, Subir

PY - 2013/12/1

Y1 - 2013/12/1

N2 - A tree structure is often used in wireless sensor networks to deliver collected 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 as long as no node in the tree fails. Since the connectivity of the tree is one, failure of any one node disconnects the tree and may disable the sink node from collecting data from some of the sensor nodes. In this paper we study the problem of enhancing the fault tolerance capability of a data gathering tree by adding a few additional links so that the failure of any one sensor would not disconnect the tree. Assuming that the addition of each link to the tree involves some cost, we study the problem of least-cost augmentation of the tree, so that even after failure of a single node, all the surviving nodes will remain connected to the sink node. We prove that the least-cost tree augmentation problem is NP-complete. Moreover, we provide an approximation algorithm with performance bound of two. The experimental evaluations of the algorithm demonstrate that the approximation algorithm performs even better in practice and almost always produces near-optimal solution.

AB - A tree structure is often used in wireless sensor networks to deliver collected 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 as long as no node in the tree fails. Since the connectivity of the tree is one, failure of any one node disconnects the tree and may disable the sink node from collecting data from some of the sensor nodes. In this paper we study the problem of enhancing the fault tolerance capability of a data gathering tree by adding a few additional links so that the failure of any one sensor would not disconnect the tree. Assuming that the addition of each link to the tree involves some cost, we study the problem of least-cost augmentation of the tree, so that even after failure of a single node, all the surviving nodes will remain connected to the sink node. We prove that the least-cost tree augmentation problem is NP-complete. Moreover, we provide an approximation algorithm with performance bound of two. The experimental evaluations of the algorithm demonstrate that the approximation algorithm performs even better in practice and almost always produces near-optimal solution.

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

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

U2 - 10.1007/978-3-642-35668-1_10

DO - 10.1007/978-3-642-35668-1_10

M3 - Conference contribution

AN - SCOPUS:84893900613

SN - 9783642356674

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 133

EP - 147

BT - Distributed Computing and Networking - 14th International Conference, ICDCN 2013, Proceedings

T2 - 14th International Conference on Distributed Computing and Networking, ICDCN 2013

Y2 - 3 January 2013 through 6 January 2013

ER -