Optimal Resource Allocation for Wireless Powered Sensors: A Perspective From Age of Information
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
We investigate a wireless powered sensor network, in which multiple sensors generate data and send their data to a base station (BS) periodically. Each sensor first harvests energy from the BS via wireless power transfer and then uses its available energy to transmit to the BS its data. We target minimal average age of information, by optimizing the energy harvesting time and the bandwidth allocation during the sensors' transmissions. The research problem is hard to solve, as some notations in the problem do not have a closed-form expression. To optimally solve the problem, we first show that there is a one-to-one mapping from the energy harvesting time to the bandwidth allocation. We also develop a method to obtain the bandwidth allocation vector corresponding to each value of the energy harvesting time. Then we get the optimal energy harvesting time by investigating and comparing different sub-regions of energy harvesting time. Numerical results show optimality of our solution and its performance gain over a benchmark scheme based on the traditional threshold-based method.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.002 | 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