MétaCan
Menu
Back to cohort
Record W2912347247 · doi:10.1109/iccchina.2018.8641202

Adaptive Uplink OFDMA Random Access Grouping Scheme for Ultra-Dense Networks in IEEE 802.11ax

2018· article· en· W2912347247 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsHuawei Technologies (Canada)Western University
Fundersnot available
KeywordsComputer scienceTelecommunications linkComputer networkScheme (mathematics)Random accessSoftware deploymentIEEE 802Orthogonal frequency-division multiplexingDistributed computingReal-time computingQuality of service

Abstract

fetched live from OpenAlex

IEEE 802.11ax, which is the next-generation WLAN standard, aims at providing highly efficient communication in ultra-dense networks. However, due to the high quantity of stations (STAs) in dense deployment scenarios, the potential high collision rate significantly degrades the network efficiency of WLAN. In this paper, we propose an adaptive grouping scheme to overcome this challenge in IEEE 802.11ax using Uplink OFD-MA Random Access (UORA). In order to achieve the optimal utilization efficiency of resource units (RUs), we first analyze the relationship between group size and RU efficiency. Based on this result, an adaptive STA grouping algorithm is proposed to cope with the performance fluctuation of 802.11ax due to remainder stations after grouping. The analysis and simulation results demonstrate that our adaptive grouping algorithm dramatically improves the performance of both the system and each STA in the ultra-dense 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.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: Methods · Consensus signal: none
Teacher disagreement score0.928
Threshold uncertainty score0.839

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.001
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.048
GPT teacher head0.318
Teacher spread0.271 · 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

Citations22
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207