Percolation and connectivity on the signal to interference ratio graph

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a Poisson point process (PPP), percolation (formation of an unbounded connected cluster) on the resulting SIR graph is studied as a function of the density of the PPP. It is shown that for a small enough threshold, there exists a closed interval of densities for which percolation happens with non-zero probability. Conversely, it is shown that for a large enough threshold, there exists a closed interval of densities for which the probability of percolation is zero. Connectivity properties of the SIR graph are also studied by restricting all the nodes to lie in a bounded area. Assigning separate frequency bands or time-slots proportional to the logarithm of the number of nodes to different nodes for transmission/reception is shown to be necessary and sufficient for guaranteeing connectivity in the SIR graph.

[1]  Edmund M. Yeh,et al.  Directed Percolation in Wireless Networks with Interference and Noise , 2007, ArXiv.

[2]  Jean-Baptiste Gouéré,et al.  Existence of subcritical regimes in the Poisson Boolean model of continuum percolation , 2006, math/0611369.

[3]  François Baccelli,et al.  Impact of interferences on connectivity in ad hoc networks , 2005, IEEE/ACM Transactions on Networking.

[4]  Bartlomiej Blaszczyszyn,et al.  Connectivity in sub-Poisson networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M. Penrose.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[7]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[8]  P. R. Kumar,et al.  Internets in the sky: capacity of 3D wireless networks , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[9]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[10]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[11]  R. Meester,et al.  Continuum percolation: References , 1996 .

[12]  P. Thiran,et al.  Percolation in the signal to interference ratio graph , 2006, Journal of Applied Probability.

[13]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[14]  Chen Avin,et al.  A Note on Uniform Power Connectivity in the SINR Model , 2009, ALGOSENSORS.

[15]  M. Penrose.  On a continuum percolation model , 1991, Advances in Applied Probability.