An efficient network‐coding based back‐pressure scheduling algorithm for wireless multi‐hop networks
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
Summary Back‐pressure scheduling has been considered as a promising strategy for resource allocation in wireless multi‐hop networks. However, there still exist some problems preventing its wide deployment in practice. One of the problems is its poor end‐to‐end (E2E) delay performance. In this paper, we study how to effectively use inter‐flow network coding to improve E2E delay and also throughput performance of back‐pressure scheduling. For this purpose, we propose an efficient network coding based back‐pressure algorithm (NBP), and accordingly design detailed procedure regarding how to consider coding gain in back‐pressure based weight calculation and how to integrate it into next hop decision making in the NBP algorithm. We theoretically prove that NBP can stabilize the networks. Simulation results demonstrate that NBP can not only improve the delay performance of back‐pressure algorithm, but also achieve higher network throughput. Copyright © 2016 John Wiley & Sons, Ltd.
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.001 | 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 it