Uplink Multiple Access With Semi-Grant-Free Transmission in Integrated Satellite-Aerial-Terrestrial Networks
Bibliographic record
Abstract
This paper investigates a semi-grant-free (SGF) based transmission strategy to provide a flexible connectivity for various kinds of users in an integrated satellite-aerial-terrestrial network (ISATN). Herein, a high-altitude platform (HAP) termed as a grant-based user (GBU), which serves multiple mobile terminals (MTs) through space division multiple access (SDMA), wants to access a satellite network with multiple earth stations (ESs) termed as grant-free users (GFUs) simultaneously via non-orthogonal multiple access (NOMA) assisted SGF. To this end, we first propose two SGF-based uplink transmission schemes for both perfect channel state information (CSI) and imperfect CSI cases. When perfect CSI is available, a zero-forcing based beamforming (BF) scheme is used in HAP network while an adaptive transmit power allocation (ATPA) approach is adopted for SGF transmission. When only imperfect CSI is available, BF scheme employing the derived channel correlation matrix of HAP-MT link is proposed to achieve SDMA, and a novel ATPA strategy with rate probability constraint is proposed to guarantee quality-of-service of the GBU. Next, we derive the closed-form throughput expressions to evaluate the performance of the considered ISATN with the proposed two SGF-based schemes. Finally, computer simulations are conducted to validate the theoretical performance analysis and show the superiority of the proposed schemes over the related works. Moreover, our numerical results not only demonstrate a satisfactory performance of the proposed SGF-based scheme using imperfect CSI, but also reveal the impact of CSI errors on the system performance.
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.001 | 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.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".