Energy-Efficient Resource Allocation for NOMA-MEC Networks With Imperfect CSI
Bibliographic record
Abstract
The combination of non-orthogonal multiple access (NOMA) and multi-access edge computing (MEC) can significantly improve the system performance including communication coverage, spectrum efficiency, etc. In this article, we focus on energy-efficient resource allocation for a multi-user multi-BS NOMA-MEC network with imperfect channel state information (CSI), where each user can upload its tasks to multiple base stations (BSs) for remote executions. We propose an optimization scheme, including task assignment, power allocation and user association, to minimize energy consumption. Specifically, we transform the probabilistic problem into a non-probabilistic one. To efficiently solve this nonconvex energy minimization problem, we first investigate the one-user two-BS case and derive the optimal closed-form expressions of task assignment and power allocation via the bilevel programming method. Subsequently, based on the derived optimal solution, we propose a low complexity algorithm for the user association in the multi-user multi-BS scenario. Simulations demonstrate that the proposed algorithm can yield much better performance than the conventional OMA scheme and the identical results with lower complexity from the exhaustive search with the small number of BSs.
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.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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".