Secure and Energy Efficient Transmission for RSMA-Based Cognitive Satellite-Terrestrial Networks
Bibliographic record
Abstract
Rate-splitting multiple access (RSMA) has recently received considerable attention due to its high efficiency in both spectral utilization and energy consumption. Inspired by this emerging technique, this letter presents a secure beamforming (BF) scheme for RSMA-based cognitive satellite terrestrial networks in the presence of multiple eavesdroppers. Assuming that the system operates in the millimeter wave band and only imperfect wiretap channel state information is available at the satellite and terrestrial base station, our objective is to maximize the secrecy-energy efficiency of the earth station (ES) while meeting the constraints on the ES secrecy rate, the cellular users' rate requirements, and transmit power budgets of the satellite and base station. As the formulated optimization problem is mathematically intractable, by applying successive convex approximation and Taylor expansion methods, we propose a robust BF scheme to convert the nonconvex objective and constraints into convex ones, which can be iteratively solved. The effectiveness and superiority of the proposed scheme are confirmed through simulation results.
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.000 | 0.001 |
| 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.001 |
| Research integrity | 0.000 | 0.000 |
| 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".