Secrecy Performance of Friendly Jammer Assisted Cooperative NOMA Systems with Internal Eavesdroppers
Bibliographic record
Abstract
In non-orthogonal multiple access (NOMA) systems, serving multiple users in shared resource blocks can allow untrusted users to overhear the messages of other users. In this context, we study a network consisting of a base station (BS), a near user and a far user, where the latter attempts to overhear the message of the former. The near user is a full-duplex (FD) node that can also act as a relay. Two operating scenarios are considered: 1) friendly jammer (FJ), where the FD node broadcasts noise for degrading the channel between the BS and the far user, while receiving data from the BS; and 2) friendly jammer relay (FJR), where, in addition to degrading the channel between the BS and the far user, the FD node relays the message of the far user. We investigate the secrecy performance of the network by characterizing the secrecy outage probability (SOP) in both scenarios. We obtain the exact SOP of the FJ case, and an approximation for the SOP of the FJR scenario, both expressed in closed-form. Numerical results confirm the accuracy of the analytical results. For a given BS power budget and power allocation to the users, it is demonstrated that the jamming and relaying powers are prominent factors to make the NOMA-FJR scheme superior to NOMA-FJ, as well as to conventional and cooperative NOMA 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 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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".