Search arXivSearch

arXiv · 1511.07374

Path Loss, Shadow Fading, and Line-Of-Sight Probability Models for 5G Urban Macro-Cellular Scenarios

Abstract

This paper presents key parameters including the line-of-sight (LOS) probability, large-scale path loss, and shadow fading models for the design of future fifth generation (5G) wireless communication systems in urban macro-cellular (UMa) scenarios, using the data obtained from propagation measurements at 38 GHz in Austin, US, and at 2, 10, 18, and 28 GHz in Aalborg, Denmark. A comparison of different LOS probability models is performed for the Aalborg environment. Alpha-betagamma and close-in reference distance path loss models are studied in depth to show their value in channel modeling. Additionally, both single-slope and dual-slope omnidirectional path loss models are investigated to analyze and contrast their root-mean-square (RMS) errors on measured path loss values. While the results show that the dual-slope large-scale path loss model can slightly reduce RMS errors compared to its singleslope counterpart in non-line-of-sight (NLOS) conditions, the improvement is not significant enough to warrant adopting the dual-slope path loss model. Furthermore, the shadow fading magnitude versus distance is explored, showing a slight increasing trend in LOS and a decreasing trend in NLOS based on the Aalborg data, but more measurements are necessary to gain a better knowledge of the UMa channels at centimeter- and millimeter-wave frequency bands.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shu Sun, Timothy A. Thomas, Theodore S. Rappaport, Huan Nguyen, Istvan Z. Kovacs, Ignacio Rodrigue. 2015-11-24. Path Loss, Shadow Fading, and Line-Of-Sight Probability Models for 5G Urban Macro-Cellular Scenarios. https://doi.org/10.1109/glocomw.2015.7414036

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