Search arXivSearch

arXiv · 1606.04749

Network Densification in 5G: From the Short-Range Communications Perspective

Abstract

Besides advanced telecommunications techniques, the most prominent evolution of wireless networks is the densification of network deployment. In particular, the increasing access points/users density and reduced cell size significantly enhance spatial reuse, thereby improving network capacity. Nevertheless, does network ultra-densification and over-deployment always boost the performance of wireless networks? Since the distance from transmitters to receivers is greatly reduced in dense networks, signal is more likely to be propagated from long- to short-range region. Without considering short-range propagation features, conventional understanding of the impact of network densification becomes doubtful. With this regard, it is imperative to reconsider the pros and cons brought by network densification. In this article, we first discuss the short-range propagation features in densely deployed network and verify through experimental results the validity of the proposed short-range propagation model. Considering short-range propagation, we further explore the fundamental impact of network densification on network capacity, aided by which a concrete interpretation of ultra-densification is presented from the network capacity perspective. Meanwhile, as short-range propagation makes interference more complicated and difficult to handle, we discuss possible approaches to further enhance network capacity in ultra-dense wireless networks. Moreover, key challenges are presented to suggest future directions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junyu Liu, Min Sheng, Lei Liu, Jiandong Li. 2017-07-17. Network Densification in 5G: From the Short-Range Communications Perspective. https://arxiv.org/abs/1606.04749

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