Fair Scheduling for Energy Harvesting Nodes
Bibliographic record
Abstract
This letter considers the problem of scheduling in the multiple input multiple output (MIMO) multiple-access wireless channel, where the transmitters are energy harvesting nodes (EHNs) that are powered by renewable energy sources (RESs). In this letter the conventional scheduling objective of maximizing rate is augmented by two other objectives, regulating fairness, and stabilization of the stored energy processes of the EHNs. This problem is formulated as a network of energy queues, which represent the batteries. Considering the stochastic nature of the wireless channel and the energy harvesting processes, this letter employs Lyapunov drift plus penalty technique to develop a cross-layer scheduler that operates in a slotted-time and distributed manner. At each epoch it selects an EHN for transmission and computes the transmit power. As an added advantage, the power control algorithm still retains the optimal water-filling solution. Through simulations, the proposed solution is compared against a conventional max-rate scheduler and is shown to better enforce fairness, stabilize the battery levels, and minimize the required battery capacity.
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 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.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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".