Adaptive Cooperative Task Offloading for Energy-Efficient Small Cell MEC Networks
Bibliographic record
Abstract
Cooperative task offloading has emerged as a compelling computing paradigm for balancing spatially uneven task workloads and computational resources in distributed mobile edge computing (MEC) systems. However, enabling cooperation among multiple MEC nodes inevitably requires extra communication and computational energy overheads which might counteract the cooperation gain without energy-efficient offloading mechanisms. This paper presents an adaptive cooperative task offloading algorithm aiming at maximizing the time-averaged energy efficiency for small cell MEC networks enabled by millimeter-wave backhauls. With the considered network dynamics, the proposed algorithm makes a good tradeoff between the harvested cooperation utility and the total energy consumption in the long term. In addition, our algorithm ensures the network stability and fulfills the task admission rate requirement of each individual user equipment, by making slot-based decisions over time without requiring a-priori knowledge of the network dynamics. Simulation results verify the outstanding performance of the proposed algorithm by comparing with the static cooperative and adaptive non-cooperative schemes.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".