Randomized algorithms
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th 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
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Efficient construction of low weight bounded degree planar spanner
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Topology control is the problem of selecting neighbors for each node in a wireless network, so that the resulting network has a number of useful properties. More precisely, a topology control protocol P takes as input a network G and aims to construct a spanning subgraph GP, that is sparse, “energy minimizing” and has sufficient connectivity so as to guarantee multiple short paths between pairs of nodes in G. Currently, topology control protocols assume that nodes in G reside in some Euclidean (usually, 2-dimensional) space and rely on geometric information such as node locations and pairwise distances between nodes to produce GP with appropriate properties. However, these protocols are extremely sensitive to errors in location information and this feature makes them impractical because errors in location and distance information are pervasive in practical systems. This paper presents and analyzes two randomized topology control protocols that are tolerant to errors in pairwise distance estimates. The first protocol, called RTC (short for randomized topology control) uses no geometric information, relying only on connectivity information and is therefore completely immune to errors in location or distance information. The second protocol, called ε-RTC, generalizes the first protocol. Allowing for errors in distance estimates, but assuming that relative errors are bounded above by ε, the second protocol produces an output network that is symmetric, connected, sparse, and has good spanner properties. As $\varepsilon \longrightarrow 0$, ε-RTC behaves like the XTC protocol (R. Wattenhofer and A. Zollinger, “XTC: A practical topology control algorithm for ad-hoc networks”, WMAN 2004) and for large values of ε, it behaves like RTC. Our results hold whenever the input network is a unit disk graph or even a quasi unit disk graph.