Robust Security Energy Efficiency Optimization for RIS-Aided Cell-Free Networks With Multiple Eavesdroppers
Bibliographic record
Abstract
In this paper, we investigate the energy efficiency (EE) problem under reconfigurable intelligent surface (RIS)-aided secure cell-free networks, where multiple legitimate users and eavesdroppers (Eves) exist. We formulate a max-min security EE optimization problem by jointly designing the distributed active beamforming and artificial noise at base stations as well as the passive beamforming at RISs under practical constraints. To deal with it, we first divide the original optimization problem into two sub-ones, and then propose an iterative optimization algorithm to solve each sub-problem based on the fractional programming, constrained concave-convex procedure (CCCP) and semi-definite programming (SDP) techniques. After that, these two sub-problems are alternatively solved until convergence, and the final solutions are obtained. Next, we extend to the imperfect channel state information of the Eves’ links, and investigate the robust security EE beamforming optimization problem by bringing the outage probability constraints. Based on this, we first transform the uncertain outage probability constraints into the certain ones by the Bernstein-type inequality and sphere boundary techniques, and then propose an alternatively iterative algorithm to obtain the solutions of the original problem based on the S-procedure, successive convex approximation, CCCP, and SDP techniques. Finally, the simulation results are conducted to show the effectiveness of the proposed schemes.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".