MétaCan
Menu
Back to cohort
Record W2126605442 · doi:10.1109/lcn.2010.5735788

A variable neighborhood search method for multi-objective channel assignment problem in Multi-Radio WMNs

2010· article· en· W2126605442 on OpenAlexaff
Jihene Rezgui, Abdelhakim Hafid, Racha Ben Ali, Michel Gendreau

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsComputer scienceWireless mesh networkHandoverThroughputComputer networkChannel (broadcasting)Overhead (engineering)HeuristicChannel allocation schemesVariable (mathematics)Interference (communication)Variable neighborhood searchWirelessMathematical optimizationWireless networkAlgorithmMetaheuristicMathematicsTelecommunications

Abstract

fetched live from OpenAlex

Channel assignment schemes in Multi-Radio Wireless Mesh Networks (MR-WMNs) usually leave several links sharing the same channel within overlapped transmissions or interference ranges; this is especially true when only one radio is used or when the number of radios is very small compared to the number of orthogonal channels. In this paper, we propose a new multi-objective optimization model for channel assignment (CA) performed during the MR-WMNs planning process. Given the expected traffic demand, the goal is to (1) minimize user handoff overhead; (2) minimize traffic load variances to achieve load balancing; (3) maximize overall throughput; and (4) maximize Jain's fairness index to achieve fairness among mesh clients. We also propose a variable neighborhood search (VNS) meta-heuristic to solve our model. Simulation results show that our proposed approach achieves good performance in terms of delay, loss rate, overall throughput and fairness in the MR-WMNs.

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.002
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.005
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.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.039
GPT teacher head0.317
Teacher spread0.278 · 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

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207