Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.10791

Reconfigurable Intelligent Surfaces: Performance Assessment Through a System-Level Simulator

Bjorn Sihlbom·Marios I. Poulakis·Marco Di Renzo
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surfaces (RISs) are considered a promising technology for boosting the coverage and for enhancing the spectral efficiency of wireless systems, as well as for taming the wireless environment. The potential benefits of RISs are currently being analyzed and various approaches are being proposed to address some challenges for their integration in wireless networks. Currently available studies to quantify the potential gains of deploying RISs in wireless networks are limited to simple network topologies, while no system-level assessments have been reported to date. Network-level, e.g., on the scale of hundreds of square meters, simulations are, however, the first step to quantify the actual value of emerging technologies and the steppingstone before considering large scale system-level experimental evaluations and network deployments. Towards this direction, this article reports the first system-level simulation results and analysis of an RIS deployment in a typical urban city that is served by a fifth-generation cellular network. The obtained system-level simulation results unveil that the benefits of RISs vary depending on the operating frequency and the size of the surfaces. Specifically, we investigate the performance improvement that RISs can provide, in terms of outdoor and indoor coverage and ergodic rate, when deployed in mid (C-band) and high (millimeter-wave) frequency bands. For example, the obtained results unveil that the deployment of RISs enhances the coverage of cell-edge users from 77% to 95% in the C-band and from 46% to 95% in the millimeter-wave band.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bjorn Sihlbom, Marios I. Poulakis, Marco Di Renzo. 2021-11-21. Reconfigurable Intelligent Surfaces: Performance Assessment Through a System-Level Simulator. https://arxiv.org/abs/2111.10791

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↗