Performance Comparison of Max-Delay Constrained Schedulers in Rayleigh Fading Channels
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 consider the energy efficient scheduling of packets for a single user wireless link. We propose packet schedulers that meet individual per-packet maximum-delay constraints and present their performance. The main emphasis is on deriving an easy-to-implement scheduler with low average power consumption in a Rayleigh fading channel, and to identify areas of potential improvements. We firstly outline the structure of the optimal scheduler with prescient knowledge of the channel and the traffic pattern, and an efficient algorithm to derive this optimal schedule. This provides a baseline for comparison for all other schedulers. From the insight gained in the study of the prescient optimal scheduler, we remove algorithmic dependency on the future to derive a practical scheduler that has energy usage at most 6 dB away from the prescient optimal at 0.1% probability of bit outage under Rayleigh fading conditions.
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.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