On code design in joint MAC scheduling and wireless network coding
Bibliographic record
Abstract
In this paper, we investigate the problem of network coding and media scheduling in wireless multihop networks. Unique characteristics of the wireless media, such as omnidirectional transmissions and destructive interference, as well as the limitations of wireless nodes to either transmit or receive at any given time, imply new code design constraints for wireless networks. In this work, following the approach of Sagduyu et al., given a sufficient set of conflict-free link sets, we investigate necessary and sufficient conditions to design a capacity-achieving network coding solution for wireless networks. This approach uses a wired graph representation of the wireless network to design wireless network codes. Our study shows that the proposed approach works only if we preserve all of the code characteristics of the wired graph in the wireless one. We show the shortcoming of previous studies through a counterexample and explore this case further. The resulting insight is summarized in Theorem 1, which proves that unequal time shares allocated to conflict-free link sets will result in changing coding coefficients as the sets with larger time share are scheduled repeatedly.
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.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.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 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".