The Community for Technology Leaders
Green Image
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 minimum weight based approach and nearest neighbor augmentation approach, to address this problem. Furthermore, we give theoretical analysis for the proposed algorithms. Among other results, we show 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 disjoint paths. When $k=1$, this approach solves the minimum power all-to-one $1$-connected topology control 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 also is the first to demonstrate that the minimum power all-to-one 1-connected topology control problem has an optimal solution.
INDEX TERMS
Algorithm/protocol design and analysis, Mobile Computing
CITATION
Feng Wang, Yingshu Li, Ding-Zhu Du, Xiuzhen Cheng, My T. Thai, "Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks", IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 322-331, March 2008, doi:10.1109/TMC.2007.70743
106 ms
(Ver 3.3 (11022016))