Secure Transmission in Cognitive Satellite Terrestrial Networks
Bibliographic record
Abstract
This paper investigates the physical layer security of a satellite network, whose downlink spectral resource is shared with a terrestrial cellular network. We propose to employ a multi-antenna base station (BS) as a source of green interference to enhance secure transmission in the satellite network. By taking the mutual interference between these two networks into account, we first formulate a constrained optimization problem to maximize the instantaneous rate of the terrestrial user while satisfying the interference probability constraint of the satellite user. Then, with the assumption that imperfect channel state information (CSI) and statistical CSI of the link between the BS and satellite user are available at the BS, we present two beamforming (BF) schemes, namely, hybrid zero-forcing and partial zero-forcing to solve the optimization problem and obtain the BF weight vectors in a closed form. Moreover, we analyze the secrecy performance of primary satellite network by considering two practical scenarios, namely: Scenario I, the eavesdroppers CSI is unknown at the satellite and Scenario II, the eavesdroppers CSI is known at the satellite. Specifically, we derive the analytical expressions for the secrecy outage probability for Scenario I and the average secrecy rate for Scenario II. Finally, numerical results are provided to confirm the superiority of the proposed BF schemes and the validity of the performance analysis, as well as demonstrate the impacts of various parameters on the secrecy performance of the satellite network.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".