Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2203.13478

Smart Wireless Environments Enabled by RISs: Deployment Scenarios and Two Key Challenges

George C. Alexandropoulos·Maurizio Crozzoli·Dinh-Thuy Phan-Huy·Konstantinos D. Katsanos·Henk Wymeersch·Petar Popovski·Philippe Ratajczak·Yohann Bénédic·Marie-Helene Hamon·Sebastien Herraiz Gonzalez·Raffaele D'Errico·Emilio Calvanese Strinati
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable Intelligent Surfaces (RISs) constitute the enabler for programmable propagation of electromagnetic signals, and are lately being considered as a candidate physical-layer technology for the demanding connectivity, reliability, localization, and sustainability requirements of next generation wireless communications networks. In this paper, we present various deployment scenarios for RIS-enabled smart wireless environments that have been recently designed by the ongoing EU H2020 RISE-6G project. The scenarios are taxonomized according to performance objectives, in particular, connectivity and reliability, localization and sensing, as well as sustainability and secrecy. We identify various deployment strategies and sketch the core architectural requirements in terms of RIS control and signaling, depending on the RIS hardware architectures and their respective capabilities. Furthermore, we introduce and discuss, via preliminary simulation results and reflectarray measurements, two key novel challenges with RIS-enabled smart wireless environments, namely, the area of influence and the bandwidth of influence of RISs, which corroborate the need for careful deployment and planning of this new technology.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George C. Alexandropoulos, Maurizio Crozzoli, Dinh-Thuy Phan-Huy, Konstantinos D. Katsanos, Henk Wymeersch, Petar Popovski, Philippe Ratajczak, Yohann Bénédic, Marie-Helene Hamon, Sebastien Herraiz Gonzalez, Raffaele D'Errico, Emilio Calvanese Strinati. 2022-03-25. Smart Wireless Environments Enabled by RISs: Deployment Scenarios and Two Key Challenges. https://arxiv.org/abs/2203.13478

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↗