Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1904.06946

Coverage Analysis of 3-D Dense Cellular Networks with Realistic Propagation Conditions

Aritra Chatterjee·Suvra Sekhar Das
View original source ↗Read source document ↗Export metadata ↓

Abstract

In recent times, the use of stochastic geometry has become a popular and important tool for performance analysis of next-generation dense small cell wireless networks. Usually, such networks are modeled using 2 dimensional spatial Poisson point processes (SPPP). Moreover, the distinctive effects of line-of-sight (LOS) and non-line-of-sight (NLOS) propagation are also not explicitly taken into account in such analysis. The aim of the current work is to bridge this gap by modeling the access point (AP) and user equipment (UE) locations by 3-dimensional SPPP and considering the realistic LOS/NLOS channel models (path loss and small scale fading) as reported in existing standards. The effect of UE density on downlink coverage probability has also been investigated. In this process, the probabilistic activity of APs has been analytically modeled as a function of AP and UE densities. The derived upper bound of coverage probability is found to be numerically simple as well as extremely tight in nature and thus can be used as a close approximation of the same.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aritra Chatterjee, Suvra Sekhar Das. 2019-12-31. Coverage Analysis of 3-D Dense Cellular Networks with Realistic Propagation Conditions. https://arxiv.org/abs/1904.06946

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗