Supporting IoT With Rate-Splitting Multiple Access in Satellite and Aerial-Integrated Networks
Bibliographic record
Abstract
To satisfy the explosive access demands of Internet-of-Things (IoT) devices, various kinds of multiple access techniques have received much attention. In this article, we investigate the multicast communication of a satellite and aerial-integrated network (SAIN) with rate-splitting multiple access (RSMA), where both satellite and unmanned aerial vehicle (UAV) components are controlled by network management center and operate in the same frequency band. Considering a content delivery scenario, the UAV subnetwork adopts the RSMA to support massive access of IoT devices (IoTDs) and achieve desired performances of interference suppression, spectral efficiency, and hardware complexity. We first formulate an optimization problem to maximize the sum rate of the considered system subject to the signal-interference-plus-noise-ratio requirements of IoTDs and per-antenna power constraints at the UAV and satellite. To solve this nonconvex optimization problem, we exploit the sequential convex approximation and the first-order Taylor expansion to convert the original optimization problem into a solvable one with the rank-one constraint, and then propose an iterative penalty function-based algorithm to solve it. Finally, simulation results verify that the proposed method can effectively suppress the mutual interference and improve the system sum rate compared to the benchmark schemes.
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.001 |
| 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 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".