Secrecy Performance of Small-Cell Networks With Transmitter Selection and Unreliable Backhaul Under Spectrum Sharing Environment
Bibliographic record
Abstract
We investigate the secrecy performance of an underlay small-cell cognitive radio network under unreliable backhaul connections. The small-cell network shares the same spectrum with the primary network, ensuring that a desired outage probability constraint is always met in the primary network. To improve the security of the small-cell cognitive network, we propose three sub-optimal small-cell transmitter selection schemes, namely sub-optimal transmitter selection, minimal interference selection, and minimal eavesdropping selection. Closed-form expressions of the non-zero secrecy rate, secrecy outage probability, and ergodic secrecy capacity are provided for the schemes along with asymptotic expressions. We also propose an optimal selection scheme and compare performances with the sub-optimal selection schemes. Computable expressions for the non-zero secrecy rate and secrecy outage probability are presented for the optimal selection scheme. Our results show that by increasing the primary transmitter's power and the number of small-cell transmitters, the system performance improves. The selection scheme, the backhaul reliability, and the primary user quality-of-service constraint also have a significant impact on secrecy performance.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| 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".