MétaCan
Menu
Back to cohort
Record W1967272974 · doi:10.1109/mobhoc.2006.278648

Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks

2006· article· en· W1967272974 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 institutionsSimon Fraser University
Fundersnot available
KeywordsWireless mesh networkComputer networkOrder One Network ProtocolSwitched meshComputer scienceShared meshMesh networkingIEEE 802.11sWireless networkBottleneckThroughputH.248Distributed computingWirelessDefault gatewayTelecommunicationsEmbedded system

Abstract

fetched live from OpenAlex

Wireless mesh networking has emerged as a promising technology in providing economical and scalable broadband Internet accesses. A wireless mesh network consists of mesh routers and mesh clients, connected in an ad hoc manner via wireless links. A subset of the mesh routers, referred to as gateway nodes, are capable of external Internet connections. Since other mesh routers and clients have to access the Internet through the gateway nodes, these nodes can easily become bottlenecks in the network. In this paper, we present a novel queuing model based analysis of the delay and throughput of the gateway nodes. Our simulation results suggest that the analytical results are quite accurate, which provides an effective guideline for gateway-related design and optimization in wireless mesh networks

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.000
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.736
Threshold uncertainty score0.414

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.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
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.007
GPT teacher head0.222
Teacher spread0.215 · 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

Citations39
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207