MétaCan
Menu
Back to cohort
Record W1967996014 · doi:10.1109/mobhoc.2007.4428616

Efficient Mesh Router Placement in Wireless Mesh Networks

2007· article· en· W1967996014 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
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsWireless mesh networkComputer scienceComputer networkRouterSwitched meshShared meshHeuristicDistributed computingOrder One Network ProtocolThe InternetConstraint (computer-aided design)Mesh networkingWireless networkDefault gatewayWirelessMathematicsTelecommunications

Abstract

fetched live from OpenAlex

The placement of mesh routers (MRs) in building a wireless mesh network (WMN) is the first step to ensure the desired network performance. Given a network domain, the fundamental issue in placing MRs is to find the minimal configuration of MRs so as to satisfy the network coverage, connectivity, and Internet traffic demand. In this paper, the problem is addressed under a constraint network model in which the traffic demand is non-uniformly distributed and the candidate positions for MRs are pre-decided. After formulating the MR placement problem, we first provide the theoretical analysis to validate the traffic demand and determine the optimal position of Internet gateway (IGW). To reduce complexity of determining the locations of MRs while satisfying the traffic constraint, we propose an effective heuristic algorithm to obtain an close-to-optimal solution. Finally, our simulation results verify our analytical model and show the effectiveness of our proposed algorithm.

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: Empirical · Consensus signal: none
Teacher disagreement score0.931
Threshold uncertainty score0.761

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.000
Open science0.0010.001
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.010
GPT teacher head0.236
Teacher spread0.227 · 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

Citations265
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207