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.
Original language | English (US) |
---|---|
Pages (from-to) | 163-168 |
Number of pages | 6 |
Journal | International Journal of Sensor Networks |
Volume | 2 |
Issue number | 3-4 |
DOIs | |
State | Published - 2007 |
Externally published | Yes |
Keywords
- Fault tolerance
- K-outconnected graph
- Topology control
- Wireless networks
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering