Delay performance of CSMA policies in multihop wireless networks: A new perspective
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
In this paper, we study the delay performance of CSMA policies in wireless networks, where the delay is defined as the average time that a silent wireless link needs to wait until it accesses the channel for packet transmission. It is well-known that CSMA policies can incur an access delay that may be correlated over time and may grow exponentially with the network size. This discourages practical implementation of CSMA policies in even mid-sized networks. In this paper, we provide a new perspective on the delay performance of CSMA policies. We present recently developed results for two important interference models and show how CSMA policies can be used to ensure an access delay that is memoryless over time or that does not grow with the network size. The two interference models that we consider are primary interference and the ¿lattice interference graph¿. Our results suggest that CSMA policies can achieve a delay performance, as well as a delay-throughput trade-off, that makes them viable to be used in practice.
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