Random transceiver networks

DOI10.1239/AAP/1246886613MaRDI QIDQ5320653zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Mark Walters, Paul Balister

Publication date 22 July 2009

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1239/aap/1246886613

zbMATH Keywords

percolationrandom geometric graphrandom network

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Communication networks in operations research (90B18)

Recommendations

• Continuum percolation with steps in an annulus
• Percolation in the signal to interference ratio graph
• SINR percolation for Cox point processes with random powers
• Optimal paths on the space-time SINR random graph
• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

Cites work

• Continuum percolation with steps in an annulus
• Continuum percolation with steps in the square or the disc
• Continuum percolation with unreliable and spread-out connections
• Efficient communication in an ad-hoc network
• Efficient measurement of the percolation threshold for fully penetrable discs
• scientific article; zbMATH DE number 3410334 (Why is no real title available?)
• Improved upper bounds for the critical probability of oriented percolation in two dimensions
• Percolation
• Random graphs.

Cited in

(6)

• Routeing on trees
• Long paths and connectivity in 1-independent random graphs
• SINR percolation for Cox point processes with random powers
• 1‐independent percolation on ℤ2×Kn
• On connectivity in random graph models with limited dependencies
• Line-of-sight Cox percolation on Poisson-Delaunay triangulation

This page was built for publication: Random transceiver networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320653)