MétaCan
Menu
Back to cohort
Record W2059870810 · doi:10.1109/glocom.2013.6831523

Adaptive access control of CSMA/CA in wireless LANs for throughput improvement

2013· article· en· W2059870810 on OpenAlex
Mahsa Derakhshani, Tho Le‐Ngoc

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsMcGill University
Fundersnot available
KeywordsThroughputComputer networkWireless lanComputer scienceCarrier sense multiple access with collision avoidanceAccess controlWirelessTelecommunications

Abstract

fetched live from OpenAlex

This paper presents an adaptive access scheme for Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) aiming to take advantage of multi-user diversity and improve throughput, while supporting distributed and asynchronous operation. By assigning channel-adaptive access probabilities to different users, this method prioritizes users who gain most from using a channel, and hence, improves channel utilization in comparison with a simple random access scheme. Furthermore, in this method, access probabilities are designed to achieve long-term fairness by keeping a same average access probability for all users. Performance of the proposed adaptive CSMA/CA is evaluated in terms of collision probability and saturation throughput by analysis and simulation. Illustrative and analytical results show that A-CSMA/CA significantly improves the throughput by controlling contention among users and decreasing the collision probability, specifically in a large network.

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.000
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: none
Teacher disagreement score0.974
Threshold uncertainty score0.385

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.001
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.024
GPT teacher head0.284
Teacher spread0.260 · 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

Quick stats

Citations8
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207