Dynamic Computation Offloading in IoT Fog Systems With Imperfect Channel-State Information: A POMDP Approach
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
Driven by the growing popularity of mobile applications, such as the Internet of Things (IoT), fog computing has been envisioned as a promising approach to enhance the computation capability of mobile devices and reduce the energy consumption. In this article, we aim to investigate the dynamic computation offloading problem in the IoT fog system under the fast time-varying wireless channel conditions. Our work differs from the existing work, which is based on the assumption that the channel-state information can be perfectly obtained by the offloading agent (e.g., the IoT device). In reality, due to hardware limitation, short sensing time, and network connectivity issues in IoT fog systems, it is difficult for the IoT device to have the perfect knowledge of a dynamic channel environment. Therefore, in this article, we propose a partially observable offloading scheme to enable the IoT device to make the optimal offloading decision with imperfect channel-state information. The optimization problem is formulated as a partially observable Markov decision process (POMDP) formulation, with the objective of minimizing the IoT device's energy consumption while meeting its requirement on task processing delay. To find the optimal offloading solution, an offline algorithm based on the deep recurrent $Q$ -network (DRQN) is developed. Finally, extensive simulation experiments are performed to evaluate the effectiveness of the proposed offloading scheme.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.000 |
| 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 it