Analysis of New Distributed-Media Access-Control Schemes for IEEE 802.11 Wireless Local-Area Networks
Bibliographic record
Abstract
Many modifications are proposed in the literature to improve the throughput performance of the distributed coordination function (DCF) under congested environments. These improvements are achieved by modifying the contention-window reset mechanism used in the DCF protocol. However, the main drawback with these modifications is the high backoff process overhead. We have recently proposed a new modification to DCF (N-DCF) to improve the throughput performance by reducing the average backoff overhead. In this paper, we propose a throughput model for N-DCF, which is applicable for arbitrary load conditions. We verify the throughput model by NS-2 simulations. Then, we compare the performance of N-DCF with other recently proposed DCF enhancements in the literature. Comparisons reveal that only N-DCF provides throughput improvement in the request-to-send/clear-to-send access mechanism. Finally, we propose two more schemes to further improve the performance of our original N-DCF scheme.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.005 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".