MétaCan
Menu
Back to cohort
Record W4254034155 · doi:10.22215/etd/2015-11008

Spectrum Requirements for Interference-Free Wireless Mesh Networks

2015· dissertation· en· W4254034155 on OpenAlexaff
Aizaz U. Chaudhry

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsWireless mesh networkComputer scienceHeuristicsInterference (communication)ThroughputChannel (broadcasting)Wireless networkChannel allocation schemesMesh networkingBeamformingComputer networkZero-forcing precodingAdjacent-channel interferenceWirelessDistributed computingTopology (electrical circuits)MIMOTelecommunicationsEngineeringPrecoding

Abstract

fetched live from OpenAlex

In classical channel assignment (CA) in Multi-Radio Multi-Channel (MRMC) Wireless Mesh Networks (WMNs), the number of available frequency channels is assumed to be fixed.Two links that are within the interference range of each other could be assigned the same frequency channel, causing co-channel interference that degrades the network throughput.The objective of this research is to develop a realistic CA method that finds the smallest number of frequency channels required for interferencefree communication among the mesh nodes (MNs) in order to achieve the maximum network throughput while maintaining fairness among the multiple network flows in a dynamic MRMC WMN.As a first step towards achieving this objective, a novel CA method is developed, which ensures interference-free communication among the MNs based on the protocol interference model, and determines a small number of frequency channels required to achieve the maximum network throughput while maintaining fairness among the multiple network flows.Secondly, in order to develop a CA method using a realistic interference model, a novel and computationally simple method of building the conflict graph based on signal-to-interference ratio model with shadowing is developed.Computationally simple and effective new heuristics are developed to find channel assignments from the conflict graph for the extended coloring problem with cumulative interference constraints.The heuristics are orders of magnitude faster than the exact solution method while consistently returning near-optimum results.As a final step, the problem of co-channel interference in a dynamic WMN environment is addressed by using beamforming.The novel Linear Array Beamformingbased Channel Assignment (LAB-CA) method reduces the number of frequency channels required (NCR) and significantly outperforms the classical omni-directional antenna pattern-based channel assignment (OAP-CA) method in terms of NCR.The beamforming-based CA framework is extended to incorporate heterogeneous MNs (i.e.nodes having differing numbers of radio interfaces).The LAB-CA method for heterogeneous MNs outperforms OAP-CA for heterogeneous MNs in terms of NCR in both sparse and dense mesh networks.It also provides a further significant reduction in NCR when the number of antennas in the linear antenna arrays of MNs is increased.

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

Direct model labels (unvalidated)

Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.

Model armCategoriesStudy designConfidence
gptno category
Domain: not available · Genre: Other
About the Canadian research system: no · About a Canadian topic: no
Theoretical or conceptuallow
grokno category
Domain: not available · Genre: Methods
About the Canadian research system: no · About a Canadian topic: no
Theoretical or conceptuallow
opusno category
Domain: not available · Genre: Other
About the Canadian research system: no · About a Canadian topic: no
Simulation or modelingmedium
models splitAgreement compares identical category sets and study designs across arms.

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.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.000

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.291
Teacher spread0.261 · 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

Labeled directly by 3 models reading the full record.

The models applied no category: nothing in the taxonomy fit this work.

The models disagree on parts of this classification; every voice is preserved in the section at the end of the page.

Study designTheoretical or conceptual · Simulation or modeling
Domainnot available
GenreOther · Methods

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

Citations2
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207