Online Power Control Optimization for Wireless Transmission with Energy Harvesting and Storage
Bibliographic record
Abstract
We consider wireless transmission over fading channel powered by energy harvesting and storage devices. Assuming a finite battery storage capacity, we design an online power control strategy aiming at maximizing the long-term time-averaged transmission rate under battery operational constraints for energy harvesting. We first formulate the stochastic optimization problem, and then develop techniques to transform this problem and employ techniques from Lyapunov optimization to design the online power control solution. In particular, we propose an approach to handle unbounded channel fade which cannot by directly dealt with by Lyapunov framework. Our proposed algorithm determines the transmission power based only on the current energy state of the battery and channel fade conditions, without requiring any knowledge of the statistics of energy arrivals or fading channels. Our online power control solution is a three-stage closed-form solution depending on the battery energy level. It not only provides strategic energy conservation through the battery energy control, but also reveals an opportunistic transmission style based on fading condition, both of which improve the long-term time-averaged transmission rate. We further characterize the performance bound of our proposed algorithm to the optimal solution with a general fading distribution. Simulation results demonstrate a significant performance gain of our proposed online algorithm over alternative online approaches.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".