Beamforming and Jamming Optimization for IRS-Aided Secure NOMA Networks
Bibliographic record
Abstract
The integration of intelligent reflecting surface (IRS) and multiple access provides a promising solution to improved coverage and massive connections at low cost. However, securing IRS-aided networks remains a challenge since the potential eavesdropper also has access to an additional IRS reflection link, especially when the eavesdropping channel state information is unknown. In this paper, we propose an IRS-assisted non-orthogonal multiple access (NOMA) scheme to achieve secure communication via artificial jamming, where the multi-antenna base station sends the NOMA and jamming signals together to the legitimate users with the assistance of IRS, in the presence of a passive eavesdropper. The sum rate of legitimate users is maximized by optimizing the transmit beamforming, the jamming vector and the IRS reflecting vector, satisfying the quality of service requirement, the IRS reflecting constraint and the successive interference cancellation (SIC) decoding condition. In addition, the received jamming power is adapted at the highest level at all legitimate users for successful cancellation via SIC. To tackle this non-convex optimization problem, we first decompose it into two subproblems, and then each subproblem is converted into a convex one using successive convex approximation. An alternate optimization algorithm is proposed to solve them iteratively. Numerical results show that the secure transmission in the proposed IRS-NOMA scheme can be effectively guaranteed with the assistance of artificial jamming.
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.001 |
| 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.000 | 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".