Multi-User Dynamic Computation Offloading and Resource Allocation in 5G MEC Heterogeneous Networks with Static and Dynamic Subchannels
Bibliographic record
Abstract
With the rapid development of Mobile Edge Computing (MEC) technology, the computationally intensive requests of end devices can be offloaded to MEC servers directly, which equipped at the edge of wireless networks. Through offloading, the performances such as the execution delay as well as the energy consumption can be effectively improved, which can significantly enhance the quality of user experience. Given the dynamics and randomness of computation requests arrival, the energy in the battery, the radio network environment, and the computation resource in the MEC server, it is a challenge to perform efficient offloading. Based on these problems, this paper proposes dynamic optimization schemes with queuing theory for the cases of the static subchannel and dynamic subchannel during a time slot separately in 5G MEC heterogeneous networks with multiple MDs equipped with the function of energy harvesting. In the schemes, offloading decisions and radio allocation strategies will be dynamically coordinated. They are also jointly allocated along with changing wireless communication resources and computation demands aiming to minimize the system average execution delay. Specifically, it is assumed that the offloading requests can be transmitted through either macro base stations or small base stations. In the case of the static subchannel, a joint resource allocation and computation offloading scheme based on Lyapunov optimization and Simulated Annealing Genetic Algorithm (SAGA) is put forward. As for the dynamic subchannel, the master-and-slave model is adopted and solved by SAGA and Sequential Quadratic Programming (SQP) method. At last, the effectiveness of the proposed schemes is verified through several simulations.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".