Characterization of the Critical Density for Percolation in Random Geometric Graphs

Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density lambdac(d) for d-dimensional Poisson random geometric graphs in continuum percolation theory. By using a probabilistic analysis which incorporates the clustering effect in random geometric graphs, we develop a new class of analytical lower bounds for the critical density lambdac(d). These analytical lower bounds are the tightest known to date, and reveal a deep underlying relationship between clustering effects and percolation phenomena.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[3]  Massimo Franceschetti,et al.  Information theoretic bounds on the throughput scaling of wireless relay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

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

[6]  J. Quintanilla,et al.  Efficient measurement of the percolation threshold for fully penetrable discs , 2000 .

[7]  Alon,et al.  Systematic derivation of percolation thresholds in continuum systems. , 1990, Physical review. A, Atomic, molecular, and optical physics.

[8]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[9]  Béla Bollobás,et al.  Continuum percolation with steps in the square or the disc , 2005, Random Struct. Algorithms.

[10]  Jehoshua Bruck,et al.  Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks. , 2003 .

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