Unique coverage in Boolean models

DOI10.1016/J.SPL.2016.11.020MaRDI QIDQ511534zbMATH OpenOpenAlexFDO

Authors Martin Haenggi, Amites Sarkar

Publication date 21 February 2017

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.02032

zbMATH Keywords

Poisson processBoolean modelcellular networkcoverage

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Communication networks in operations research (90B18)

Abstract: Consider a wireless cellular network consisting of small, densely scattered base stations. A user $u$ is {em uniquely covered} by a base station $b$ if $u$ is the only user within distance $r$ of $b$. This makes it possible to assign the user $u$ to the base station $b$ without interference from any other user $u^{\prime }$. We investigate the maximum possible proportion of users who are uniquely covered. We solve this problem completely in one dimension and provide bounds, approximations and simulation results for the two-dimensional case.

Recommendations

• Approximations for characteristics of nomadic communications
• On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications
• Unique coverage with rectangular regions
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• A cellular network model with Ginibre configured base stations

Cites work

• scientific article; zbMATH DE number 193944 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Continuum Percolation
• Sentry selection in wireless networks
• The probability of covering a sphere with N circular caps

Cited in

(1)

• Approximations for characteristics of nomadic communications

This page was built for publication: Unique coverage in Boolean models

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