Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1510.07176

On the Effect of Fronthaul Latency on ARQ in C-RAN Systems

Qing Han·Chenxi Wang·Marco Levorato·Osvaldo Simeone
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the Cloud Radio Access Network (C-RAN) architecture, a Control Unit (CU) implements the baseband processing functionalities of a cluster of Base Stations (BSs), which are connected to it through a fronthaul network. This architecture enables centralized processing at the CU, and hence the implementation of enhanced interference mitigation strategies, but it also entails an increased decoding latency due to the transport on the fronthaul network. The fronthaul latency may offset the benefits of centralized processing when considering the performance of protocols at layer 2 and above. This letter studies the impact of fronthaul latency on the performance of standard Automatic Retransmission reQuest (ARQ) protocols, namely Stop and Wait, Go-Back-N and Selective Repeat. The performance of the C-RAN architecture in terms of throughput and efficiency is compared to the that of a conventional cellular system with local processing, as well as with that of a proposed hybrid C-RAN system in which BSs can perform decoding. The dynamics of the system are modeled as a multi-dimensional Markov process that includes sub-chains to capture the temporal correlation of interference and channel gains. Numerical results yield insights into the impact of system parameters such as fronthaul latency and signal-to-interference ratio on different ARQ protocols.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qing Han, Chenxi Wang, Marco Levorato, Osvaldo Simeone. 2015-10-24. On the Effect of Fronthaul Latency on ARQ in C-RAN Systems. https://arxiv.org/abs/1510.07176

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↗