Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks

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.

[1]  Jennifer C. Hou,et al.  FLSS: a fault-tolerant topology control algorithm for wireless networks , 2004, MobiCom '04.

[2]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

[3]  Harold N. Gabow,et al.  A representation for crossing set families with applications to submodular flow problems , 1993, SODA '93.

[4]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  X. Jia,et al.  Energy efficient broadcast routing in static ad hoc wireless networks , 2004, IEEE Transactions on Mobile Computing.

[6]  Paramvir Bahl,et al.  Distributed Topology Control for Wireless Multihop Ad-hoc Networks , 2001, INFOCOM.

[7]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[8]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[9]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[10]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[11]  Weili Wu,et al.  Optimal topology control for balanced energy consumption in wireless networks , 2005, J. Parallel Distributed Comput..

[12]  T. Gonzalez,et al.  Minimum-energy Broadcast in Simple Graphs with Limited Node Power , 2007 .

[13]  Tibor Jordán,et al.  Approximating k-outconnected Subgraph Problems , 1998, APPROX.

[14]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[15]  Satoru Iwata,et al.  A faster capacity scaling algorithm for minimum cost submodular flow , 2002, Math. Program..

[16]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2002, MobiHoc '02.

[17]  Ding-Zhu Du,et al.  Fault Tolerant Topology Control for Oneto-All Communications in Symmetric Wireless Networks , 1993 .

[18]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[19]  Nicole Immorlica,et al.  Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks , 2003, IEEE/ACM Transactions on Networking.

[20]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[21]  Samir Khuller,et al.  Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.

[22]  Peng-Jun Wan,et al.  Range Assignment for High Connectivity in Wireless Ad Hoc Networks , 2003, ADHOC-NOW.

[23]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[24]  A. Frank,et al.  An application of submodular flows , 1989 .

[25]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[26]  Xiaohua Jia,et al.  Power Assignment for k-Connectivity in Wireless Ad Hoc Networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  Alfredo Navarra,et al.  Topology Control and Routing in Ad Hoc Networks , 2010, Graphs and Algorithms in Communication Networks.