Unique coverage in Boolean models

DOI10.1016/J.SPL.2016.11.020zbMATH Open1417.90046arXiv1608.02032OpenAlexW2483379357MaRDI QIDQ511534FDOQ511534

Authors: Martin Haenggi, Amites Sarkar 

Publication date: 21 February 2017

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

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.

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

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

zbMATH Keywords

Poisson processBoolean modelcellular networkcoverage

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)