MétaCan
Menu
Back to cohort
Record W2024216782 · doi:10.1109/icc.2012.6364854

Improved channel assignment for WLANs by exploiting partially overlapped channels with novel CIR-based user number estimation

2012· article· en· W2024216782 on OpenAlexaff
Penghui Mi, Xianbin Wang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer scienceChannel (broadcasting)Computer networkChannel allocation schemesPhysical layerWirelessWireless lanScheme (mathematics)IEEE 802.11AlgorithmReal-time computingTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

Aiming at solving the problem of frequency scarcity in dense IEEE 802.11 wireless local area networks (WLANs), a novel channel assignment scheme is proposed in this paper where we explore the partially overlapped channels for additional frequency resources. In our proposed algorithm, we first introduce a user number estimation algorithm at physical layer where the number of users is determined by the number of different channel impulse responses (CIRs). Then, the IEEE 802.11 channels are allocated to the users in a distributed way with the purpose of maximizing system capacity using the information of the number of users for each channel. The interferences caused by the channel partial overlap are mathematically evaluated and involved in the channel assignment. Simulations verify that the proposed algorithm can estimate the number of users accurately while at the same time, significantly improving the system performance.

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.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.027
GPT teacher head0.270
Teacher spread0.243 · 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
GenreMethods

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

Citations4
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207