Joint task offloading and resource allocation in mobile edge computing with energy harvesting
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Mobile edge computing (MEC) is considered to be a promising technique to enhance the computation capability and reduce the energy consumption of smart mobile devices (SMDs) in the sixth-generation (6G) networks. With the huge increase of SMDs, many applications of SMDs can be interrupted due to the limited energy supply. Combining MEC and energy harvesting (EH) can help solve this issue, where computation-intensive tasks can be offloaded to edge servers and the SMDs can also be charged during the offloading. In this work, we aim to minimize the total energy consumption subject to the service latency requirement by jointly optimizing the task offloading ratio and resource allocation (including time switching (TS) factor, uplink transmission power of SMDs, downlink transmission power of eNodeB, computation resources of SMDs and MEC server). Compared with the previous studies, the task uplink transmission time, MEC computation time and the computation results downloading time are all considered in this problem. Since the problem is non-convex, we first reformulate it, and then decompose it into two subproblems, i.e., joint uplink and downlink transmission time optimization subproblem (JUDTT-OP) and joint task offloading ratio and TS factor optimization subproblem (JTORTSF-OP). By solving the two subproblems, a joint task offloading and resource allocation with EH (JTORAEH) algorithm is proposed to solve the considered problem. Simulation results show that compared with other benchmark methods, the proposed JTORAEH algorithm can achieve a better performance in terms of the total energy consumption.
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.
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.001 | 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 it