Fast low degree connectivity of ad-hoc networks via percolation

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 rst ecient 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 effcient 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