Search arXivSearch

arXiv · 2308.02676

Target-Mounted Intelligent Reflecting Surface for Secure Wireless Sensing

Abstract

In this paper, we consider a challenging secure wireless sensing scenario where a legitimate radar station (LRS) intends to detect a target at unknown location in the presence of an unauthorized radar station (URS). We aim to enhance the sensing performance of the LRS and in the meanwhile prevent the detection of the same target by the URS. Under this setup, conventional stealth-based approaches such as wrapping the target with electromagnetic wave absorbing materials are not applicable, since they will disable the target detection by not only the URS, but the LRS as well. To tackle this challenge, we propose in this paper a new target-mounted IRS approach, where intelligent reflecting surface (IRS) is mounted on the outer/echo surface of the target and by tuning the IRS reflection, the strength of its reflected radar signal in any angle of departure (AoD) can be adjusted based on the signal's angle of arrival (AoA), thereby enhancing/suppressing the signal power towards the LRS/URS, respectively. To this end, we propose a practical protocol for the target-mounted IRS to estimate the LRS/URS channel and waveform parameters based on its sensed signals and control the IRS reflection for/against the LRS/URS accordingly. Specifically, we formulate new optimization problems to design the reflecting phase shifts at IRS for maximizing the received signal power at the LRS while keeping that at the URS below a certain level, for both the cases of short-term and long-term IRS operations with different dynamic reflection capabilities. To solve these non-convex problems, we apply the penalty dual decomposition method to obtain high-quality suboptimal solutions for them efficiently. Finally, simulation results are presented that verify the effectiveness of the proposed protocol and algorithms for the target-mounted IRS to achieve secure wireless sensing, as compared with various benchmark schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaodan Shao, Rui Zhang. 2023-08-04. Target-Mounted Intelligent Reflecting Surface for Secure Wireless Sensing. https://arxiv.org/abs/2308.02676

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