Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Virtual coordinates for ad hoc and sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
A Distributed Topology Control Algorithm for P2P Based Simulations
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Hi-index | 0.00 |
Topology control protocols attempt to reduce the energy consumption of nodes in an ad-hoc wireless network while maintaining sufficient network connectivity. Topology control protocols with various features have been proposed, but they all lack robustness and are extremely sensitive to faulty information from neighbors. For example, the XTC protocol (R. Wattenhofer and A. Zollinger, XTC: A practical topology control algorithm for ad-hoc networks, WMAN 2004) can be forced to construct a disconnected network even if two nodes in the network receive slightly faulty distance information from one neighbor each. A key step in most localized topology control protocols is one in which each node establishes a total ordering on its set of neighbors based on information received from them. In this paper, we propose a metric for robustness of localized topology control protocols and define an r-robust topology control protocol as one that returns a correct output network even when its neighborhood orderings have been modified by up to r–1 adjacent swaps by a malicious adversary. We then modify XTC in a simple manner to derive a family of r-robust protocols for any r 1. The price we pay for increased robustness is in terms of decreased network sparsity; however we can bound this decrease and we show that in transforming XTC from a 1-robust protocol (which it trivially is) into an r-robust protocol, the maximum vertex degree of the output network increases by a factor of $O(\sqrt{r})$. An extremely pleasant side-effect of our design is that the output network is both $\Omega(\sqrt{r})$-edge connected and $\Omega(\sqrt{r})$-vertex connected provided the input network is. Thus ensuring robustness of the protocol seems to give fault-tolerance of the output for free. Our r-robust version of XTC is almost as simple and practical as XTC and like XTC it only involves 2 rounds of communication between a node and its neighbors.