π€ AI Summary
To address insufficient communication robustness and sensing security in Integrated Sensing and Communication (ISAC) networks, this paper proposes a secure ISAC framework jointly enabled by transmissive Reconfigurable Intelligent Surfaces (RIS) and Rate-Splitting Multiple Access (RSMA). A time-division sensing-communication resource sharing mechanism is introduced; adversarial user channels and channel state information (CSI) uncertainty are explicitly modeled; and artificial noise is embedded in the RSMA common stream. For the first time, secrecy outage probability and the CramΓ©rβRao Bound (CRB) are jointly optimized within ISAC security design. The resulting non-convex robust optimization problem is solved via block coordinate descent, second-order cone programming (SOCP), the S-procedure, and successive convex approximation. Numerical results demonstrate that the proposed scheme significantly improves secrecy energy efficiency under CSI errors, reduces CRB by 32%, effectively suppresses eavesdropping and interference, and ensures highly reliable secure sensing and communication.
π Abstract
In this paper, we propose a novel transmissive reconfigurable intelligent surface transceiver-enhanced robust and secure integrated sensing and communication 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, 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-based second-order cone programming 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 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 and the Cram'{e}r-Rao boundary.