A Decentralized BF Scheme for Downlink NOMA Transmission in Integrated Satellite and Aerial Networks
Bibliographic record
Abstract
This paper proposes a robust decentralized beam-forming (BF) scheme for downlink non-orthogonal multiple access (NOMA) transmission in an integrated satellite and aerial network (ISAN) to reduce both power consumption and signaling overhead. By employing the imperfect channel state information (CSI) and the imperfect successive interference cancellation (SIC), we formulate an optimization problem to minimize the total transmit power, subject to the rate requirements of both satellite and aerial terminals, and the transmit power budget of satellite and aerial platforms. To address this complex problem, we adopt S-procedure to transform the nonconvex constraints into convex ones and then propose a decentralized BF algorithm using Lagrange duality to obtain the satisfactory solutions in an efficient way. Finally, simulation results demonstrate that our proposed scheme can achieve a similar performance but at a lower signaling overhead as compared with the centralized BF method, and confirm the superiority of the proposed scheme in terms of power consumption over other existing works.
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".