IRS-aided bi-static ISAC system with security constraint

Integrated sensing and communication (ISAC), as a promising component in 6G, however, is faced with security challenges that the critical communication information will be leaked to the sensing targets. This paper investigates an intelligent reflecting surface (IRS) aided bi-static ISAC system. The objective is to maximize the sensing signal-to-interference-and-noise ratio (SINR) with security and other constraints. A joint beamforming, reflection and receiving filter design is proposed. Alternating optimization (AO) based iterative algorithm leveraging semi-definite relaxation (SDR), Dinkelbach's transform, and successive convex approximation (SCA) techniques is utilized to solve the non-convex problem. It is found that the proposed scheme provides significantly better sensing performance with security constraint.

Authors

Institutions

Publication Details

Published
2024-12-04
DOI
https://doi.org/10.1145/3636534.3698233
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

IRS-aided bi-static ISAC system with security constraint

Fan Wang, Na Li, Xiaofeng Tao, Kai Yang
Cryptography and Data Security
article

IRS-aided bi-static ISAC system with security constraint

Fan Wang, Na Li, Xiaofeng Tao, Kai Yang
article en

Abstract

Integrated sensing and communication (ISAC), as a promising component in 6G, however, is faced with security challenges that the critical communication information will be leaked to the sensing targets. This paper investigates an intelligent reflecting surface (IRS) aided bi-static ISAC system. The objective is to maximize the sensing signal-to-interference-and-noise ratio (SINR) with security and other constraints. A joint beamforming, reflection and receiving filter design is proposed. Alternating optimization (AO) based iterative algorithm leveraging semi-definite relaxation (SDR), Dinkelbach's transform, and successive convex approximation (SCA) techniques is utilized to solve the non-convex problem. It is found that the proposed scheme provides significantly better sensing performance with security constraint.

Beijing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 80%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.