Fault-tolerant topology control for all-to-one and one-to-all communication in wireless networks

Feng Wang, My T. Thai, Yingshu Li, Xiuzhen Cheng, Ding Zhu Du

Research output: Contribution to journalArticle

40 Citations (Scopus)

Abstract

This paper introduces the problem of fault-tolerant topology control for all-to-one and one-to-all communication in static wireless networks with asymmetric wireless links. This problem is important in both theoretical and practical aspects. We investigate two approaches, namely, the minimum-weight-based approach and the augmentation-based approach, to address this problem. Furthermore, we prove that the minimum-weight-based approach has a k-approximation algorithm for all-to-one fault-tolerant topology control, where k is the number of node-disjoint paths. When k = 1, this approach solves the minimum power sink tree problem. To the best of our knowledge, this paper is the first to study the fault-tolerant topology control for all-to-one and one-to-all communication in asymmetric static wireless networks and is also the first to demonstrate that the minimum power sink tree problem has a polynomial time optimal solution.

Original languageEnglish (US)
Pages (from-to)322-331
Number of pages10
JournalIEEE Transactions on Mobile Computing
Volume7
Issue number3
DOIs
StatePublished - Mar 2008

Fingerprint

Wireless networks
Topology
Communication
Approximation algorithms
Telecommunication links
Polynomials

Keywords

  • Fault tolerance
  • k-InConnectivity
  • k-OutConnectivity
  • Topology control
  • Wireless networks

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)

Cite this

Fault-tolerant topology control for all-to-one and one-to-all communication in wireless networks. / Wang, Feng; Thai, My T.; Li, Yingshu; Cheng, Xiuzhen; Du, Ding Zhu.

In: IEEE Transactions on Mobile Computing, Vol. 7, No. 3, 03.2008, p. 322-331.

Research output: Contribution to journalArticle

Wang, Feng ; Thai, My T. ; Li, Yingshu ; Cheng, Xiuzhen ; Du, Ding Zhu. / Fault-tolerant topology control for all-to-one and one-to-all communication in wireless networks. In: IEEE Transactions on Mobile Computing. 2008 ; Vol. 7, No. 3. pp. 322-331.
@article{4acd752b329d44f9b07a49149a16ead5,
title = "Fault-tolerant topology control for all-to-one and one-to-all communication in wireless networks",
abstract = "This paper introduces the problem of fault-tolerant topology control for all-to-one and one-to-all communication in static wireless networks with asymmetric wireless links. This problem is important in both theoretical and practical aspects. We investigate two approaches, namely, the minimum-weight-based approach and the augmentation-based approach, to address this problem. Furthermore, we prove that the minimum-weight-based approach has a k-approximation algorithm for all-to-one fault-tolerant topology control, where k is the number of node-disjoint paths. When k = 1, this approach solves the minimum power sink tree problem. To the best of our knowledge, this paper is the first to study the fault-tolerant topology control for all-to-one and one-to-all communication in asymmetric static wireless networks and is also the first to demonstrate that the minimum power sink tree problem has a polynomial time optimal solution.",
keywords = "Fault tolerance, k-InConnectivity, k-OutConnectivity, Topology control, Wireless networks",
author = "Feng Wang and Thai, {My T.} and Yingshu Li and Xiuzhen Cheng and Du, {Ding Zhu}",
year = "2008",
month = "3",
doi = "10.1109/TMC.2007.70743",
language = "English (US)",
volume = "7",
pages = "322--331",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Fault-tolerant topology control for all-to-one and one-to-all communication in wireless networks

AU - Wang, Feng

AU - Thai, My T.

AU - Li, Yingshu

AU - Cheng, Xiuzhen

AU - Du, Ding Zhu

PY - 2008/3

Y1 - 2008/3

N2 - This paper introduces the problem of fault-tolerant topology control for all-to-one and one-to-all communication in static wireless networks with asymmetric wireless links. This problem is important in both theoretical and practical aspects. We investigate two approaches, namely, the minimum-weight-based approach and the augmentation-based approach, to address this problem. Furthermore, we prove that the minimum-weight-based approach has a k-approximation algorithm for all-to-one fault-tolerant topology control, where k is the number of node-disjoint paths. When k = 1, this approach solves the minimum power sink tree problem. To the best of our knowledge, this paper is the first to study the fault-tolerant topology control for all-to-one and one-to-all communication in asymmetric static wireless networks and is also the first to demonstrate that the minimum power sink tree problem has a polynomial time optimal solution.

AB - This paper introduces the problem of fault-tolerant topology control for all-to-one and one-to-all communication in static wireless networks with asymmetric wireless links. This problem is important in both theoretical and practical aspects. We investigate two approaches, namely, the minimum-weight-based approach and the augmentation-based approach, to address this problem. Furthermore, we prove that the minimum-weight-based approach has a k-approximation algorithm for all-to-one fault-tolerant topology control, where k is the number of node-disjoint paths. When k = 1, this approach solves the minimum power sink tree problem. To the best of our knowledge, this paper is the first to study the fault-tolerant topology control for all-to-one and one-to-all communication in asymmetric static wireless networks and is also the first to demonstrate that the minimum power sink tree problem has a polynomial time optimal solution.

KW - Fault tolerance

KW - k-InConnectivity

KW - k-OutConnectivity

KW - Topology control

KW - Wireless networks

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

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

U2 - 10.1109/TMC.2007.70743

DO - 10.1109/TMC.2007.70743

M3 - Article

VL - 7

SP - 322

EP - 331

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 3

ER -