Joint Computation Offloading and Resource Allocation for Edge-Cloud Collaboration in Internet of Vehicles via Deep Reinforcement Learning
Bibliographic record
Abstract
Mobile edge computing (MEC) and cloud computing (CC) have been considered as the key technologies to improve the task processing efficiency for Internet of Vehicles (IoV). In this article, we consider a random traffic flow and dynamic network environment scenario where MEC and CC are collaborated for processing delay-sensitive and computation-intensive tasks in IoV. We study the joint optimization of computation offloading and resource allocation (CORA) with the objective of minimizing the system cost of processing tasks subject to the processing delay and transmission rate constraints. To attack the challenges brought by the dynamic environment, we use the Markov decision process model for formulating the dynamic optimization problem, and apply a deep reinforcement learning (DRL) technique to deal with high-dimensional and continuous states and action spaces. Then, we design a CORA algorithm, which is able to effectively learn the optimal scheme by adapting to the network dynamics. Extensive simulation experiments are conducted, in which we compare the CORA algorithm with both non-DRL algorithms and DRL algorithms. The experimental results show that the CORA algorithm outperforms others with excellent training convergence and performance in processing delay and processing cost.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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".