Joint Trajectory Design, Task Data, and Computing Resource Allocations for NOMA-Based and UAV-Assisted Mobile Edge Computing
Bibliographic record
Abstract
Mobile edge computing (MEC) has been considered as a promising technique to address the explosively growing computation-intensive applications. Thanks to the flexibility of the unmanned aerial vehicles (UAVs), the UAV-assisted MEC can serve mobile terminals (MTs) effectively, i.e., the computing server installed on the UAV can flexibly change its location to serve MTs. Moreover, since non-orthogonal multiple access (NOMA) is able to accommodate massive connectivity, the NOMA-based and UAV-assisted MEC can provide flexible computing services for MTs in large-scale access networks (e.g., sensor networks and Internet of Things). However, due to the diversity of the UAV's trajectory and the interference among MTs introduced by NOMA, the performance (e.g., energy consumption and delay) of the NOMA-based and UAV-assisted MEC system is adversely affected. Therefore, in this paper, we formulate an optimization problem to minimize the largest energy consumption among MTs by jointly optimizing the trajectory, task data and computing resource allocations, and then propose an iterative algorithm to solve the optimization problem. Furthermore, to minimize the largest energy consumption among MTs with lower complexity, we propose a fixed point service scheme and optimize the location of the fixed point. The simulation results show that the proposed optimization algorithms can effectively reduce the largest energy consumption among MTs and ensure the fairness among MTs.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 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".