TY - GEN
T1 - Analytical bounds on the critical density for percolation in wireless multi-hop networks
AU - Ng, Seh Chun
AU - Mao, Guoqiang
AU - Anderson, Brian D.O.
PY - 2011
Y1 - 2011
N2 - In this paper we develop analytical bounds on the critical density for percolation in wireless multi- hop networks, but in contrast to other studies, under a random connection model and with nodes Poissonly distributed in the plane ℝ 2. The establishment of a direct connection between any two nodes follows a random connection model satisfying some intuitively reasonable conditions, i.e. rotational and translational invariance, non- increasing monotonicity and integral boundedness. It is well known that under the above network model and connection model there exists a critical density below which almost surely a fixed but arbitrary node is connected (via single or multi-hop path) to finite number of other nodes only, and above which the node is connected to an infinite number of other nodes with a positive probability. In this paper we investigate the bounds on the critical density. The result is compared with the existing results under a specific connection model, i.e. the unit disk communication model, and it is shown that our method generates bounds close to the known ones. The result provides valuable insight into the design of large- scale wireless multi-hop networks.
AB - In this paper we develop analytical bounds on the critical density for percolation in wireless multi- hop networks, but in contrast to other studies, under a random connection model and with nodes Poissonly distributed in the plane ℝ 2. The establishment of a direct connection between any two nodes follows a random connection model satisfying some intuitively reasonable conditions, i.e. rotational and translational invariance, non- increasing monotonicity and integral boundedness. It is well known that under the above network model and connection model there exists a critical density below which almost surely a fixed but arbitrary node is connected (via single or multi-hop path) to finite number of other nodes only, and above which the node is connected to an infinite number of other nodes with a positive probability. In this paper we investigate the bounds on the critical density. The result is compared with the existing results under a specific connection model, i.e. the unit disk communication model, and it is shown that our method generates bounds close to the known ones. The result provides valuable insight into the design of large- scale wireless multi-hop networks.
KW - Poisson random connection model
KW - critical density
KW - percolation
KW - random geometric graph
UR - http://www.scopus.com/inward/record.url?scp=84857217131&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6133604
DO - 10.1109/GLOCOM.2011.6133604
M3 - Conference contribution
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -