MétaCan
Menu
Back to cohort
Record W2136731589 · doi:10.1109/wcnc.2005.1424743

Effect of relaying on capacity improvement in wireless local area networks

2005· article· en· W2136731589 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
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRelayComputer networkThroughputComputer scienceRelay channelWireless networkNode (physics)WirelessLink Access Procedure for Frame RelayPower (physics)TelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Wireless relay nodes can improve the capacity of wireless networks. In this work, we integrate wireless relay nodes into the infrastructure of a wireless local area network (WLAN). In particular, we investigate the effect of different relay strategies and optimal utilization of a fixed number of immobile relay nodes, which maximizes the expected throughput capacity of the network. We study how the number of relay nodes, the range of users, transmission power, path loss exponent, and traffic characteristics affect the optimal relay node placement and expected throughput capacity of the network. Our results show that a time-division relay strategy can far outperform a receive-and-retransmit relay strategy. Furthermore, for a wide range of system parameters, optimally placed relay nodes can significantly increase the network expected throughput capacity.

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.959
Threshold uncertainty score0.310

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.022
GPT teacher head0.261
Teacher spread0.238 · 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