MétaCan
Menu
Back to cohort
Record W2123429850 · doi:10.1109/glocom.2012.6503927

Acknowledgement-aware MPR MAC protocol for distributed WLANs: Design and analysis

2012· article· en· W2123429850 on OpenAlexaff
Arpan Mukhopadhyay, Neelesh B. Mehta, Vikram Srinivasan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer networkComputer scienceDistributed coordination functionAsynchronous communicationThroughputTelecommunications linkAcknowledgementNetwork packetLocal area networkChannel (broadcasting)Network allocation vectorAccess controlWirelessIEEE 802.11Telecommunications

Abstract

fetched live from OpenAlex

Multi-packet reception (MPR), in which a receiver can decode multiple simultaneous transmissions, significantly improves the uplink throughput of wireless local area networks (WLANs). However, the medium access control (MAC) layer must be redesigned to encourage, and not avoid, simultaneous transmissions. Asynchronous MPR MAC protocols, in which nodes independently access the channel so long as the number of ongoing transmissions is less than a threshold, are promising solutions for enabling MPR in IEEE 802.11-based WLANs. In this paper, we highlight the problem of acknowledgment (ACK) delays that arises in asynchronous MPR when multiple nodes transmit in succession without the channel becoming idle. We propose a novel asynchronous MAC protocol that reduces the ACK delays, increases throughput, and retains the distributed nature of the 802.11 distributed coordination function (DCF). An accurate renewal theoretic fixed-point analysis that leads to general analytical expressions for the saturation throughput is also developed.

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.002
metaresearch head score (Gemma)0.004
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.057
GPT teacher head0.341
Teacher spread0.284 · 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

Citations10
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207