AoI-Aware Partial Computation Offloading in IIoT With Edge Computing: A Deep Reinforcement Learning Based Approach
Bibliographic record
Abstract
With the rapid growth of the Industrial Internet of Things, a large amount of industrial data that needs to be processed promptly. Edge computing-based computation offloading can well assist industrial devices to process these data and reduce the overall time overhead. However, there are dependencies among tasks and some tasks have high latency requirements, so completing computation offloading while considering the above factors faces important challenges. In this paper, we design a computation offloading method based on a directed acyclic graph task model by modeling task dependencies. In addition to considering traditional optimization objectives in previous computation offloading problems (e.g., latency, energy consumption, etc.), we also propose an age of information (AoI) model to reflect the freshness of information and transform the task offloading problem into an optimization problem for latency, energy consumption, and AoI. To address this issue, we propose a method based on an improved dueling double deep Q-network computation offloading algorithm, named ID3CO. Specifically, it combines the advantages of deep Q-network, double deep Q-network, and dueling deep Q-network algorithms while further utilizing deep residual neural networks to improve convergence. Extensive simulations are conducted to demonstrate that ID3CO outperforms the existing baselines in terms of performance.
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.000 | 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".