Improving the Throughput Performance of IEEE 802.11 Distributed Coordination Function
Bibliographic record
Abstract
Distributed coordination function (DCF) is the basis protocol for IEEE 802.11 standard wireless local area networks. It is based on carrier sense multilple access with collision avoidance (CSMA/CA) mechanism. DCF uses backoff process to avoid collisions on the wireless channel. The main drawback in DCF is that packets have to spend more time in the backoff process which is an additional overhead to their transmission time. The channel is rendered idle when all the stations defer their transmissions due to their backoff process. Therefore the channel utilization and the total throughput on the channel can be improved by reducing the average time spent by the packets in the backoff process. In this paper, we present our proposed modification to the original IEEE 802.11 standard DCF protocol so that the channel utilization can be improved with successful packet transmissions and thereby achieve higher throughput performance. We studied the performance of the proposed media access protocol (PMAP) both numerically and through simulations using NS-2 network simulator. Results showed that PMAP achieves considerable improvement in the throughput performance
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.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".