HCAAC: Hybrid Channel Access by Admission and Contention in Wi-Fi Networks
Bibliographic record
Abstract
With the rapid growth of machine-to-machine (M2M) communications, the network infrastructure must urgently support the coexistence of real-time applications (RTA) and non-RTA. Different techniques have been developed for this purpose in wired and cellular networks, while Wi-Fi networks have received less attention. This paper proposes a hybrid channel access by admission and contention (HCAAC) scheme to achieve the coexistence of RTA and non-RTA in Wi-Fi networks. An admission-based channel access scheme is developed for RTA to guarantee a short latency by enhancing the access efficiency of RTA packets. In addition, the non-RTA performance deterioration caused by the transmission of RTA packets can be alleviated by improving the retransmission efficiency of non-RTA packets. To optimize the performance of the proposed HCAAC scheme, we analyze its performance with a two-stage solution and demonstrate how to tune the backoff parameters to minimize RTA packet latency. It is revealed that the optimal backoff parameters depend solely on the number of stations and the packet arrival rate of RTA packets. Simulations demonstrate that with the proposed HCAAC scheme, RTA packets can achieve low latency without degrading the performance of non-RTA packets, shedding light on the design of the next generation of Wi-Fi standards.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| 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".