AoI Minimization for WP-IoT With PDQN-Based Hybrid Offline/Online Learning: A Joint Scheduling and Transmission Design 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
Age of information (AoI), quantifying the freshness of status information, is a vital performance metric for monitoring Internet of Things (IoT) applications. Transmission scheduling serves as a key technique for improving AoI performance. Meanwhile, the transmission parameter, e.g. data rate, will also influence the AoI performance. In this work, we propose a novel joint scheduling and transmission rate design approach to improve the AoI performance of wireless-powered IoT (WP-IoT) networks. Specifically, our design jointly optimizes sensor scheduling and blocklength selection decisions to minimize the expected sum AoI (ES-AoI). We formulate the joint design problem into a parameterized action Markov decision process (PAMDP). Considering the hybrid discrete-continuous action space of the resulting PAMDP, we employ parameterized deep <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Q</i>-network (PDQN) and double PDQN (DPDQN) algorithms to learn the optimal joint scheduling and blocklength selection (JSBS) policy during offline training. To mitigate model inaccuracies and environmental variations, we further develop a computationally efficient PDQN-based online tuning algorithm that fine-tunes the offline-trained JSBS policy during online operation. Simulation results demonstrate that the proposed JSBS policy significantly enhances ES-AoI performance compared to fixed-blocklength scheduling and benchmark block-length selection policies. Furthermore, the JSBS policy trained with PDQN achieves performance close to that of DPDQN while surpassing standard deep reinforcement learning (DRL) training algorithms. Notably, the PDQN-based online tuning algorithm effectively reduces the ES-AoI by up to 30% compared to the untuned policy.
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.000 | 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