Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.01829

Secure Backscatter Communications Through RIS: Modeling and Performance

Masoud Kaveh·Farshad Rostami Ghadi·Zhao Li·Zheng Yan·Riku Jantti
View original source ↗Read source document ↗Export metadata ↓

Abstract

Backscatter communication (BC) has emerged as a pivotal wireless communication paradigm owing to its low-power and cost-effective characteristics. However, BC faces various challenges from its low signal detection rate to its security vulnerabilities. Recently, reconfigurable intelligent surfaces (RIS) have surfaced as a transformative technology addressing power and communication performance issues in BC. However, the potential of RIS in addressing the security challenges of BC remains uncharted. This paper investigates the secrecy performance of RIS-aided BC, where all channels are distributed according to the Fisher-Snedecor $\mathcal{F}$ distribution. Specifically, we consider a RIS with $N$ reflecting elements to help a backscatter device (BD) establish a smart environment and enhance the secrecy performance in BC. Due to the nature of BC systems, our analysis considers two possible scenarios (i) in the absence of direct links and (ii) in the presence of direct links. In both cases, we first derive compact analytical expressions of the probability density function (PDF) and cumulative distribution function (CDF) for the received signal-to-noise ratio (SNR) at both a legitimate receiver and an eavesdropper. Then, to analyze the secrecy performance, we further derive analytical expressions of the average secrecy capacity (ASC) and secrecy outage probability (SOP) for both mentioned scenarios. In addition, regarding the importance of system behavior in a high SNR regime, we provide an asymptotic analysis of the SOP and ASC. Eventually, the Monte-Carlo simulation is used to validate the analytical results, revealing that utilizing RIS can greatly improve the secrecy performance of the BC system relative to traditional BC setups that do not incorporate RIS.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Masoud Kaveh, Farshad Rostami Ghadi, Zhao Li, Zheng Yan, Riku Jantti. 2024-09-17. Secure Backscatter Communications Through RIS: Modeling and Performance. https://arxiv.org/abs/2410.01829

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗
arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗