Fault tolerant topology control for one-to-all communications in symmetric wireless networks
International Journal of Sensor Networks
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Topology control for service-oriented wireless mesh networks
IEEE Wireless Communications
Fault tolerant optimal path for data delivery in wireless sensor networks
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
Theoretical Computer Science
Self organization and self maintenance of mobile ad hoc networks through dynamic topology control
Architecting dependable systems VII
A transmission power self-optimization technique for wireless sensor networks
ISRN Communications and Networking
International Journal of Sensor Networks
Hi-index | 0.00 |
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.