Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links

We study connectivity and transmission latency in wireless networks with unreliable links from a percolation-based perspective. We first examine static models, where each link of the network is functional (active) with some probability, independently of all other links, where the probability may depend on the distance between the two nodes. We obtain analytical upper and lower bounds on the critical density for phase transition in this model. We then examine dynamic models, where each link is active or inactive according to a Markov on- off process. We show that a phase transition also exists in such dynamic networks, and the critical density for this model is the same as the one for static networks under some mild conditions. Furthermore, due to the dynamic behavior of links, a delay is incurred for any transmission even when propagation delay is ignored. We study the behavior of this transmission delay and show that the delay scales linearly with the Euclidean distance between the sender and the receiver when the network is in the subcritical phase, and the delay scales sub-linearly with the distance if the network is in the supercritical phase.

[1]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

[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]  H. Kesten.  Percolation theory for mathematicians , 1982 .

[5]  H. Poincaré,et al.  Percolation ? , 1982 .

[6]  Maria Deijfen.  Asymptotic shape in a continuum growth model , 2003, Advances in Applied Probability.

[7]  Edmund M. Yeh,et al.  Analytical Lower Bounds on the Critical Density in Continuum Percolation , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[8]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[9]  R. Durrett.  Probability: Theory and Examples , 1993 .

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

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

[12]  T. Liggett.  An Improved Subadditive Ergodic Theorem , 1985 .

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

[14]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

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

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

[17]  Edmund M. Yeh,et al.  Distributed energy management algorithm for large-scale wireless sensor networks , 2007, MobiHoc '07.

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

[19]  Patrick Thiran,et al.  Latency of wireless sensor networks with uncoordinated power saving mechanisms , 2004, MobiHoc '04.

[20]  Harry Kesten,et al.  Percolation Theory and First-Passage Percolation , 1987 .

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

[22]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[23]  Edmund M. Yeh,et al.  Characterization of the Critical Density for Percolation in Random Geometric Graphs , 2007, 2007 IEEE International Symposium on Information Theory.

[24]  Jehoshua Bruck,et al.  Continuum Percolation with Unreliable and Spread-Out Connections , 2005 .