Search arXivSearch

arXiv · 1703.09992

How Reliable and Capable is Multi-Connectivity?

Abstract

Multi-connectivity (MCo) is considered to be a key strategy for enabling reliable transmissions and enhanced data rates in fifth-generation mobile networks, as it provides multiple links from source to destination. In this work, we quantify the communication performance of MCo in terms of outage probability and throughput. For doing so, we establish a simple, yet accurate analytical framework at high signal-to-noise ratio (SNR), in which the number of links, the spectral efficiency, the path loss, and the SNR are incorporated, giving new insights into the potentials of MCo as compared with single-connectivity (SCo). These are our main contributions: (1) finding the exact coding gain of the outage probability for parallel block-fading channels; (2) quantifying the performance improvement of MCo over SCo in terms of SNR gain; and (3) comparing optimal and suboptimal combining algorithms for MCo at the receiver side, namely joint decoding, selection combining, and maximal-ratio combining, also in terms of SNR gain. Additionally, we apply our analytical framework to real field channel measurements and thereby illustrate the potential of MCo to achieve high reliability and high data rates in real cellular networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Albrecht Wolf, Philipp Schulz, Meik Dörpinghaus, José Cândido Silveira Santos Filho, Gerhard Fettweis. 2018-10-10. How Reliable and Capable is Multi-Connectivity?. https://doi.org/10.1109/tcomm.2018.2873648

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