Search arXivSearch

arXiv · 1906.00287

Performance Evaluation for the Co-existence of eMBB and URLLC Networks: Synchronized versus Unsynchronized TDD

Abstract

To ensure the high level of automation required in today's industrial applications, next-generation wireless networks must enable real-time control and automation of dynamic processes with the requirements of extreme low-latency and ultra-reliable communications. In this paper, we provide a performance assessment for the co-existence of a macro (eMBB) and a local factory (URLLC) network and evaluate the network conditions under which the latency and reliability requirements of factory automation applications are met. In particular, we evaluate the co-existence of the eMBB and URLLC networks under two scenarios: (i) synchronized TDD, in which both networks follow the same TDD pattern, and (ii) unsynchronized TDD, in which the eMBB and URLLC networks follow different TDD patterns. Simulation results show that the high downlink interference from the macro base stations towards the factory results in a reduction of the downlink URLLC capacity and service availability in case of synchronized TDD and a reduction of the uplink URLLC capacity and service availability in case of unsynchronized TDD. Finally, it is shown that a promising case for co-existence is the adjacent channel allocation, for both synchronized and unsynchronized TDD deployments. Here, the required isolation to protect the URLLC network in the worst-case scenario where the factory is located next to a macro site can be handled via the factory wall penetration loss (e.g., considering high concrete or metal-coated building walls) along with other solutions such as filters, larger separation distance, and band pairing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ursula Challita, Kimmo Hiltunen, Miurel Tercero. 2019-06-01. Performance Evaluation for the Co-existence of eMBB and URLLC Networks: Synchronized versus Unsynchronized TDD. https://arxiv.org/abs/1906.00287

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