MIMO-Based Collision Avoidance in IEEE 802.11e Networks
Bibliographic record
Abstract
In response to the growing market demand for high-performance wireless local area networks (WLANs) with quality-of-service (QoS) support, the IEEE 802.11 standard adopts the 802.11e as the medium access protocol and 802.11n-based products, which utilize multiple-input-multiple-output (MIMO) transmission systems. The medium access collision avoidance of IEEE 802.11e, even with IEEE 802.11n at the physical layer, still utilizes the enhanced distributed coordination function (EDCF) mechanism. It is known that collisions cause significant performance degradation in IEEE 802.11e EDCF-based systems. In this paper, we utilize the multiple spatial channels of MIMO technology to propose collision-mitigation enhancements to the IEEE 802.11e EDCF. The key idea of the scheme, which is called MIMO-based EDCF (M-EDCF), is the sharing of the spatial channels during the medium contention period, i.e., instead of accessing the medium using all the spatial channels, the accessing nodes use a subset of the available spatial channels. As the number of concurrent spatial channels used is less than or equal to the spatial degree of freedom, receivers can decode the transmitted signals of different medium access contenders and then coordinate their responses to avoid potential collisions. The spatial channel sharing also enables transmitters to sense the medium and terminate if they detect other ongoing medium access attempts. Simulation results show that the M-EDCF scheme substantially reduces medium access collisions. Based on the preliminary results, an adaptive optimized length of the collision-avoidance window is derived. The performance of the M-EDCF scheme based on optimized online spatial channel sharing demonstrates that the scheme further reduces medium access collisions and boosts medium utilization.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".