MétaCan
Menu
Back to cohort
Record W1594862513 · doi:10.1109/wirles.2005.1549444

Enhanced Controlled-Access and Contention-Based Algorithms for IEEE 802.11e Wireless LANs

2005· article· en· W1594862513 on OpenAlexaff
Yaser P. Fallah, Hussein Alnuweiri

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer sciencePollingIEEE 802.11e-2005Computer networkIEEE 802Inter-Access Point ProtocolQuality of serviceWireless distribution systemNetwork allocation vectorAccess controlThroughputQueueMedia access controlScheduling (production processes)WirelessWireless lanProportionally fairIEEE 802.1XWireless networkIEEE 802.11Wi-FiWi-Fi arrayRound-robin schedulingDynamic priority schedulingTelecommunications

Abstract

fetched live from OpenAlex

The 802.11e standard draft provides new features for supporting QoS in the MAC layer of the popular 802.11 wireless LAN standard. These features, however, do not provide the final solution, and the standard intentionally leaves the door open for further enhancements using these features. In this article we present our standard-based solutions for enhancing the performance of the 802.11e MAC. The proposed solutions work with the contention and controlled access parts of the 802.11e. For contention access we use dynamic configuration of the MAC parameters and increase the throughput significantly. For controlled access, we introduce an alternative to the PCF round robin polling and propose a fair scheduling algorithm that uses the 802.11e features and provides fair and prioritized access to individual stations or queues.

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 imitation

Not 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.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.015
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0030.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.001

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.

Opus teacher head0.036
GPT teacher head0.316
Teacher spread0.280 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations8
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207