Barrier Coverage

DOI10.1002/rsa.20656zbMath1349.05313OpenAlexW4247451850MaRDI QIDQ2830235

Béla Bollobás, Amites Sarkar, Paul N. Balister

Publication date: 9 November 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20656

zbMATH Keywords

connectivityPoisson processcoveragewireless sensor networksrandom geometric graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• On the coverage of k-dimensional space by k-dimensional spheres
• Random coverings in several dimensions
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Efficient measurement of the percolation threshold for fully penetrable discs
• Sentry Selection in Wireless Networks
• Matrix Analysis
• Random circles on a sphere
• Random Geometric Graphs
• Continuum Percolation
• The probability of covering a sphere with N circular caps
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes