Energy-Efficiency Optimization for Multiple Access in NOMA-Enabled Space–Air–Ground Networks
Bibliographic record
Abstract
Due to the flexible deployment of unmanned aerial vehicles (UAVs) and the wide-area coverage of satellites, the space–air–ground (SAG) communication network can provide flexible and pervasive connectivity, especially in remote areas. In this work, we investigate the uplink transmission in a SAG network, where the nonorthogonal multiple access mechanism is adopted at the UAVs to enhance the number of access from ground user equipments (UEs) and a low-earth orbit satellite offers the wireless backhaul for UAVs. In particular, the energy efficiency (EE) of the considered network is maximized by optimizing the user association (UA), power allocation (PA), and UAV 3-D trajectory jointly with the consideration of the movement of the satellite. To tackle the formulated problem, by leveraging the block coordinate descent (BCD) method, we develop a joint UA, PA, and UAV trajectory (namely, JUPT) optimization algorithm, i.e., the original problem is decomposed into three subproblems, and the subproblems are solved iteratively until convergence. Specifically, we propose to include the virtual UEs in the system and develop a low-complexity matching algorithm to effectively solve the UA problem. A successive convex approximation (SCA)-based Dinkelbach algorithm is then adopted to address the PA problem. Later, with the introduction of the auxiliary variables, the UAV 3-D trajectory subproblem is iteratively solved by the SCA method. Our numerical results demonstrate the superiority of the proposed JUPT algorithm, which obtains significantly higher EE compared to the benchmark schemes. Moreover, the rapid convergence of the JUPT algorithm is verified.
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.001 |
| 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.002 | 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".