Robust Downlink Transmission Design in IRS-Assisted Cognitive Satellite and Terrestrial Networks
Bibliographic record
Abstract
Cognitive satellite and terrestrial network (CSTN) is considered as a promising technology to provide ubiquitous connectivity for various users within wide-coverage. This paper proposes a robust downlink transmission scheme for multiple intelligent reflecting surfaces (IRSs) assisted CSTN. Here, the satellite network adopts multigroup multicast transmission scheme to serve many earth stations, while the terrestrial network exploits space division multiple access and multi-IRS-enhanced non-orthogonal multiple access technology to communicate with many terrestrial users. By assuming that these two networks share the same frequency band having only the angular information based imperfect channel state information of each user, we formulate an optimization problem to minimize the total transmit power subject to the constraints of quality-of-service requirement for each user, per-antenna transmit power budgets of satellite and BS, and unit-modulus requirement for each reflecting element. To tackle this mathematically intractable problem, we then employ angular discretization together with the successive convex approximation method to obtain the active beamforming (BF) vectors of satellite and BS, the passive BF vector of IRS, and the power allocation coefficients. Moreover, we propose a generalized zero forcing BF and alternative optimization to obtain the suboptimal solutions of the optimization problem with low computational complexity. Finally, simulation results are given to demonstrate the effectiveness and superiority of the proposed two schemes over the benchmarks.
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.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.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".