Beamforming Design for Secure RIS-Enabled ISAC: Passive RIS vs. Active RIS
Bibliographic record
Abstract
The forthcoming sixth-generation (6G) communications standard is anticipated to provide integrated sensing and communication (ISAC) as a fundamental service. These ISAC systems present unique security challenges because of the exposure of information-bearing signals to sensing targets, enabling them to potentially eavesdrop on sensitive communication information with the assistance of sophisticated receivers. Recently, reconfigurable intelligent surfaces (RISs) have shown promising results in enhancing the physical layer security of various wireless communication systems, including ISAC. However, the performance of conventional passive RIS (pRIS)-enabled systems are often limited due to multiplicative fading, which can be alleviated using active RIS (aIRS). In this paper, we consider the problem of beampattern gain maximization in a secure pRIS/aRIS-enabled ISAC system, subject to signal-to-interference-plus-noise ratio constraints at communication receivers, and information leakage constraints at an eavesdropping target. For the challenging non-convex problem of joint beamforming design at the base station and the pRIS/aRIS, we propose a novel successive convex approximation (SCA)-based method. Unlike the conventional alternating optimization (AO)-based methods, in the proposed SCA-based approach, all of the optimization variables are updated simultaneously in each iteration. The proposed method shows significant performance superiority for pRIS-aided ISAC system compared to a benchmark scheme using penalty-based AO method. Moreover, our simulation results also confirm that aRIS-aided system has a notably higher beampattern gain at the target compared to that offered by the pRIS-aided system for the same power budget. We also present a detailed complexity analysis and proof of convergence for the proposed SCA-based method.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".