Retracted: A DQN-Based Frame Aggregation and Task Offloading Approach for Edge-Enabled IoMT
Post-publication record
OpenAlex flags this work as retracted, but it carries no matching Retraction Watch record in this frame.
Bibliographic record
Abstract
The rapid expansion of wearable medical devices and health data of Internet of Medical Things (IoMT) poses new challenges to the high Quality of Service (QoS) of intelligent health care in the foreseeable 6G era. Healthcare applications and services require ultra reliable, ultra low delay and energy consumption data communication and computing. Wireless Body Area Network (WBAN) and Mobile Edge Computing (MEC) technologies empowered IoMT to deal with huge data sensing, processing and transmission in high QoS. However, traditional frame aggregation schemes in WBAN generate too much control frames during data transmission, which leads to high delay and energy consumption and is not flexible enough. In this paper, a Deep Q-learning Network (DQN) based Frame Aggregation and Task Offloading Approach (DQN-FATOA) is proposed. Firstly, different service data were divided into queues with similar QoS requirements. Then, the length of the frame aggregation was selected dynamically by the aggregation node according to the delay, energy consumption, and throughput by DQN. Finally, the number of tasks offloaded was selected due to the current state. Compared with the traditional scheme, the simulation results show that the proposed DQN-FATOA has effectively reduced delay and energy consumption, and improved the throughput and overall utilization of WBAN.
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.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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".