AoI-Minimal Online Scheduling for Wireless-Powered IoT: A Lyapunov Optimization-Based 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
This paper investigates the age of information (AoI)-based online scheduling in multi-sensor wireless powered communication networks (WPCNs) for time-sensitive Internet of Things (IoT). Specifically, we consider a typical WPCN model, where a wireless power station (WPS) charges multiple sensor nodes (SNs) by wireless power transfer (WPT), and then the SNs are scheduled in the time domain to transmit their sampled status information with their harvested energy to a mobile edge server (MES) for decision making. For such a system, we first derive a closed-form expression of the successful data transmission probability in Nakagami- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${m}$ </tex-math></inline-formula> fading channels. To pursue an efficient online scheduling policy that minimizes the Expected Weighted Sum AoI (EWSAoI) of the system, a discrete-time scheduling problem is formulated. As the problem is non-convex with non-explicit expression of the EWSAoI, we propose a Max-Weight policy based on the Lyapunov optimization theory, which schedules the SNs at the beginning of each time in terms of the one-slot conditional Lyapunov Drift. Simulations demonstrate our presented theoretical results and show that our proposed scheduling policy outperforms other baselines such as the greedy policy and random round-robin (RR) policy. Especially, when the number of SNs is relatively small, the gain achieved by the proposed policy compared to the greedy policy is considerable. Moreover, some interesting insights are also observed: 1) as the number of SNs increases, the EWSAoI also increases; 2) when the transmit power is relatively small, the larger the number of SNs, the smaller the EWSAoI; 3) the EWSAoI decreases with the increment of transmit power of the WPS and then tends to be flat; 4) the EWSAoI increases with the increment of the distance between the SNs and the MES.
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.001 | 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