MétaCan
Menu
Back to cohort
Record W2132208471 · doi:10.1002/wcm.260

Performance evaluation of an adaptive backoff scheme for WLAN

2004· article· en· W2132208471 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueWireless Communications and Mobile Computing · 2004
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceWindow (computing)SalientNetwork packetAlgorithmScheme (mathematics)Wireless lanSimple (philosophy)Feature (linguistics)Wi-FiComputer networkWirelessAdaptive algorithmReal-time computingWireless networkTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

Abstract In this paper, a simple self‐adaptive contention window adjustment algorithm for 802.11 wireless local area networks (WLAN) is proposed and analyzed. Numerical results show that the new algorithm outperforms the standard 802.11 window adjustment algorithm. Compared with the standard and previously proposed enhancement algorithms, a salient feature of our algorithm is that it performs well in both heavy and light contention cases regardless of the packet sizes and physical versions. Moreover, the adaptive window adjustment algorithm is simpler than previously proposed schemes in that no live measurement of the WLAN traffic activity is needed. Copyright © 2004 John Wiley & Sons, Ltd.

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.

Full frame distilled prediction

Teacher imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Empirical
Teacher disagreement score0.976
Threshold uncertainty score0.482

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.063
GPT teacher head0.335
Teacher spread0.272 · 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