Search arXivSearch

arXiv · 2309.15040

Zero-Energy-Device for 6G: First Real-Time Backscatter Communication thanks to the Detection of Pilots from an Ambient Commercial Cellular Network

Abstract

Ambient backscatter communication technology (AmBC) and a novel device category called zero-energy devices (ZED) have recently emerged as potential components for the forthcoming 6th generation (6G) networks. A ZED communicates with a smartphone without emitting additional radio waves, by backscattering ambient waves from base stations. Thanks to its very low consumption, a ZED powers itself by harvesting ambient light energy. However, the time variations of data traffic in cellular networks prevents AmBC to work properly. Recent works have demonstrated experimentally that a backscatter device could be detected by listening only ambient pilot signals (which are steady) instead of the whole ambient signal (which is bursty) of 4G. However, these experiments were run with a 4G base station emulator and a bulky energy greedy backscatter device. In this paper, for the first time, we demonstrate real-time AmBC on the field, with Orange commercial 4G network as ambient source and Orange Zero-Energy Device.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Papis Ndiaye, Dinh-Thuy Phan-Huy, Ayman Hassan, Jingyi Liao, Xiyu Wang, Kalle Ruttik, Riku Jantti. 2023-09-26. Zero-Energy-Device for 6G: First Real-Time Backscatter Communication thanks to the Detection of Pilots from an Ambient Commercial Cellular Network. https://arxiv.org/abs/2309.15040

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