DRL-Based Multidimensional Resource Management in SWIPT-NOMA-Enabled MEC
Bibliographic record
Abstract
Mobile edge computing (MEC) enables communication users with limited computation power to offload computation-intensive tasks to the edge server, thus dramatically enhancing the limited computing capabilities of the users. As the reality of scarce spectrum resources and the energy-constrained nature of communication users, this paper introduces non-orthogonal multiple access (NOMA) and simultaneous wireless information and power transfer (SWIPT) techniques to achieve more efficient task offloading in MEC. To minimize the number of computationally failed tasks while simultaneously satisfying different quality of service (QoS) requirements of users, a joint resource management problem of the spectrum, computation, and energy resources is formulated. Due to the non-convexity of the offloading optimization problem and the stochastic nature of the constructed MEC environment, a multiple agents deep deterministic policy gradient (MADDPG)-based resource management algorithm is proposed to manage each user’s multidimensional resources without collaborating. The simulation results show that compared to other benchmark schemes, the proposed algorithm can effectively improve both the communication and computational performances in MEC.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".