Authors: Feng Wang, Kuai Xu, My T. Thai, Ding-Zhu Du
Addresses: 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
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.
Keywords: topology control; fault tolerance; k-outconnected graph; wireless networks; sensor networks; simulation; power consumption.
International Journal of Sensor Networks, 2007 Vol.2 No.3/4, pp.163 - 168
Available online: 11 Apr 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article