Fault tolerant topology control for one-to-all communications in symmetric wireless networks

Authors:
Feng Wang;Kuai Xu;My T. Thai;Ding-Zhu Du
Affiliations:
Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA.;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA.;Department of Computer and Information Science and Engineering, University of Florida, USA.;Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA
Venue:
International Journal of Sensor Networks
Year:
2007

Citing 5
Cited 3

Improved approximation algorithms for uniform connectivity problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Minimum energy disjoint path routing in wireless ad-hoc networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks

Proceedings of the 9th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks

IEEE Transactions on Mobile Computing

Performance analysis of ALOHA and p-persistent ALOHA for multi-hop underwater acoustic sensor networks

Cluster Computing
A survey of communication/networking in Smart Grids

Future Generation Computer Systems
Distributed k-connected fault-tolerant topology control algorithms with PSO in future autonomic sensor systems

International Journal of Sensor Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the problem, namely Minimum Weight-Based Algorithm (MWBA) and Nearest Neighbour Augmentation Algorithm (NNAA) and prove that the former is a 4k approximation and the latter is a (k + 4) approximation. Through simulations, we evaluate the average performance of these two algorithms and find that MWBA is slightly better than NNAA in terms of the total power consumption.