MétaCan
Menu
Back to cohort
Record W2017319093 · doi:10.1109/icccn.2013.6614114

Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput

2013· article· en· W2017319093 on OpenAlexaff
Aizaz U. Chaudhry, John W. Chinneck, Roshdy H. M. Hafez

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsWireless mesh networkComputer scienceComputer networkThroughputShared meshSwitched meshChannel (broadcasting)Interference (communication)Mesh networkingPower controlNode (physics)Wireless networkOrder One Network ProtocolTopology (electrical circuits)Radio resource managementChannel allocation schemesWirelessPower (physics)TelecommunicationsEngineering

Abstract

fetched live from OpenAlex

In a multi-radio multi-channel wireless mesh network, a channel assignment that is based on a fixed number of available frequency channels may cause co-channel interference, which degrades the network throughput. We address this problem by ensuring interference-free communication among the mesh nodes. The main purpose of this work is to determine the minimum number of non-overlapping frequency channels required for interference-free channel assignment in order to achieve the maximum network throughput while maintaining fairness among the multiple network flows, given the location of the mesh nodes and the number of their half-duplex radio interfaces. To minimize the number of channels required, we apply our Select x for less than x Topology Control Algorithm to build the connectivity graph instead of using the classical approach based on maximum power (MP). We show that our approach outperforms the MP-based approach in terms of the number of channels required as well as the links to channels ratio for all node-degrees.

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 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 categoriesMeta-epidemiology (narrow)
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.931
Threshold uncertainty score1.000

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.0030.002
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.029
GPT teacher head0.261
Teacher spread0.232 · 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 teacher head, not a consensus.

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

Citations13
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207