LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Low degree connectivity in ad-hoc networks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Energy-optimal distributed algorithms for minimum spanning trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Brief announcement: (more) efficient pruning of ad-hoc wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Energy-optimal distributed algorithms for minimum spanning trees
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
A generalized algorithm for publish/subscribe overlay design and its fast implementation
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.01 |
Consider the following classical problem in ad-hoc networks: n devices are distributed uniformly at random in a given region. Each device is allowed to choose its own transmission radius, and two devices can communicate if and only if they are within the transmission radius of each other. The aim is to (quickly) establish a connected network of low average and maximum degree. In this paper we present the first efficient distributed protocols that, in poly-logarithmically many rounds and with high probability, set up a connected network with O(1) average degree and O(log n) maximum degree. This is asymptotically the best possible. Our algorithms are based on the following result, which is a non-trivial consequence of classical percolation theory: suppose that all devices set up their transmission radius in order to reach the K closest devices. There exists a universal constant K (independent of n) such that, with high probability, there will be a unique giant component, i.e. a connected component of size &Theta(n). Furthermore, all remaining components will be of size O(log2 n). This leads to an efficient distributed probabilistic test for membership in the giant component, which can be used in a second phase to achieve full connectivity. Preliminary experiments suggest that our approach might very well lead to efficient protocols in real wireless applications.