Enhancing Robustness and Security in ISAC Network Design: Leveraging Transmissive Reconfigurable Intelligent Surface With RSMA

In this paper, we propose a novel transmissive reconfigurable intelligent surface (TRIS) transceiver-enhanced robust and secure integrated sensing and communication (ISAC) network. A time-division sensing communication mechanism is designed for the scenario, which enables communication and sensing to share wireless resources. To address the interference management problem and hinder eavesdropping, we implement rate-splitting multiple access (RSMA), where the common stream is designed as a useful signal and an artificial noise (AN), while taking into account the imperfect channel state information and modeling the channel for the illegal users in a fine-grained manner as well as giving an upper bound on the error. We introduce the secrecy outage probability and construct an optimization problem with secrecy sum-rate as the objective functions to optimize the common stream beamforming matrix, the private stream beamforming matrix and the timeslot duration variable. Due to the coupling of the optimization variables and the infinity of the error set, the proposed problem is a nonconvex optimization problem that cannot be solved directly. In order to address the above challenges, the block coordinate descent (BCD)-based second-order cone programming (SOCP) algorithm is used to decouple the optimization variables and solving the problem. Specifically, the problem is decoupled into two subproblems concerning the common stream beamforming matrix, the private stream beamforming matrix, and the timeslot duration variable, which are solved by alternating optimization until convergence is reached. To solve the problem, S-procedure, Bernstein’s inequality and successive convex approximation (SCA) are employed to deal with the objective function and non-convex constraints. Numerical simulation results verify the superiority of the proposed scheme in improving the secrecy energy efficiency (SEE) and the Cramér-Rao boundary (CRB).

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-03-31
DOI
https://doi.org/10.1109/tcomm.2025.3555894
Citations
8
Primary Topic
Modular Robots and Swarm Intelligence
Type
article
Field-Weighted Citation Impact
5.71
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing Robustness and Security in ISAC Network Design: Leveraging Transmissive Reconfigurable Intelligent Surface With RSMA

Qiong Wu, Qingqing Wu, Nan Cheng, Xusheng Zhu et al.
8 citations
IEEE Transactions on Communications
Modular Robots and Swarm Intelligence
5.71
article

Enhancing Robustness and Security in ISAC Network Design: Leveraging Transmissive Reconfigurable Intelligent Surface With RSMA

Qiong Wu, Qingqing Wu, Nan Cheng, Xusheng Zhu, Wen Chen, Ziwei Liu, Zhendong Li
article en
8 citations

Abstract

In this paper, we propose a novel transmissive reconfigurable intelligent surface (TRIS) transceiver-enhanced robust and secure integrated sensing and communication (ISAC) network. A time-division sensing communication mechanism is designed for the scenario, which enables communication and sensing to share wireless resources. To address the interference management problem and hinder eavesdropping, we implement rate-splitting multiple access (RSMA), where the common stream is designed as a useful signal and an artificial noise (AN), while taking into account the imperfect channel state information and modeling the channel for the illegal users in a fine-grained manner as well as giving an upper bound on the error. We introduce the secrecy outage probability and construct an optimization problem with secrecy sum-rate as the objective functions to optimize the common stream beamforming matrix, the private stream beamforming matrix and the timeslot duration variable. Due to the coupling of the optimization variables and the infinity of the error set, the proposed problem is a nonconvex optimization problem that cannot be solved directly. In order to address the above challenges, the block coordinate descent (BCD)-based second-order cone programming (SOCP) algorithm is used to decouple the optimization variables and solving the problem. Specifically, the problem is decoupled into two subproblems concerning the common stream beamforming matrix, the private stream beamforming matrix, and the timeslot duration variable, which are solved by alternating optimization until convergence is reached. To solve the problem, S-procedure, Bernstein’s inequality and successive convex approximation (SCA) are employed to deal with the objective function and non-convex constraints. Numerical simulation results verify the superiority of the proposed scheme in improving the secrecy energy efficiency (SEE) and the Cramér-Rao boundary (CRB).

IEEE Transactions on CommunicationsVol. 73(10)
Jiangnan University (CN), Xidian University (CN), Shanghai Jiao Tong University (CN), Xi'an Jiaotong University (CN)
Openalex Percentile: Top 4%
Modular Robots and Swarm Intelligence
5.71
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.