WSNp1-5: Analysis of a New 802.11 Distributed Media Access Control Protocol
Bibliographic record
Abstract
Many modifications have been proposed in the literature to improve the performance of distributed coordination function (DCF) under congested environments. These improvements are achieved by modifying the contention window reset mechanism used in DCF protocol. However the main drawback with these modifications is the high backoff process overhead. Therefore we recently proposed a new DCF (N-DCF) protocol to reduce backoff process overhead. In this paper, we proposed a throughput model for N-DCF which is applicable for any arbitrary load conditions. The model was verified using NS- 2 simulations. We then compared the performance of N-DCF with the other recently proposed modifications to DCF in the literature. Comparisons have revealed that only N-DCF provides improvement in throughput performance under RTS/CTS access mechanism. Based on our observations, we further proposed two more media access control protocols to improve the performance of DCF protocol in both basic and RTS/CTS access mechanisms. Finally, we compared the performance of our proposed protocols with our original N-DCF protocol.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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".