Spectral Efficiency and Energy Efficiency Tradeoff in Multiuser RIS-Aided Mobile Edge Computing Networks
Bibliographic record
Abstract
Mobile edge computing (MEC) is emerging as a critical technology for supporting latency-sensitive and computation-intensive services-however, random wireless channel fading limits offloading rates, posing a significant challenge to MEC performance. In MEC systems, effective energy management and high-speed communication links between user devices and MEC servers are essential for supporting services that require low latency and high computation power. Reconfigurable intelligent surfaces (RIS) have been proposed as a promising solution to enhance the quality of communication links between users and MEC servers by dynamically reconfiguring the wireless propagation environment to overcome these challenges. We formulate a trade-off optimization problem to balance SE and EE in RIS-aided MEC systems, which is crucial due to limited system resources and the need for dynamic adaptation to varying network requirements-aimed at joint optimization of transmission power, phase-shift matrix, and MEC offloading and computation delays. Given the problem’s intractability, we develop an alternating optimization-based iterative algorithm incorporating quadratic transformation and successive convex approximation techniques to obtain sub-optimal solutions. Firstly, we address the minimum delay power allocation and task offloading by using quadratic transformations for fractional problems and closed-form solutions. Afterward, we optimize the phase shifts through semidefinite programming and a penalty-based approach. Simulation results validate the effectiveness of the proposed framework, demonstrating significant improvements in SE and EE compared to conventional systems without RIS or with static RIS configurations.
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.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".