Search arXivSearch

arXiv · 1505.02310

Asymptotics and Approximation of the SIR Distribution in General Cellular Networks

Abstract

It has recently been observed that the SIR distributions of a variety of cellular network models and transmission techniques look very similar in shape. As a result, they are well approximated by a simple horizontal shift (or gain) of the distribution of the most tractable model, the Poisson point process (PPP). To study and explain this behavior, this paper focuses on general single-tier network models with nearest-base station association and studies the asymptotic gain both at 0 and at infinity. We show that the gain at 0 is determined by the so-called mean interference-to-signal ratio (MISR) between the PPP and the network model under consideration, while the gain at infinity is determined by the expected fading-to-interference ratio (EFIR). The analysis of the MISR is based on a novel type of point process, the so-called relative distance process, which is a one-dimensional point process on the unit interval [0,1] that fully determines the SIR. A comparison of the gains at 0 and infinity shows that the gain at 0 indeed provides an excellent approximation for the entire SIR distribution. Moreover, the gain is mostly a function of the network geometry and barely depends on the path loss exponent and the fading. The results are illustrated using several examples of repulsive point processes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Radha K. Ganti, Martin Haenggi. 2015-11-26. Asymptotics and Approximation of the SIR Distribution in General Cellular Networks. https://arxiv.org/abs/1505.02310

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT