MétaCan
Menu
Back to cohort
Record W2167620763 · doi:10.1109/icc.2006.255412

Per-user Throughput of Opportunistic Scheduling Scheme over Broadcast Fading Channels

2006· article· en· W2167620763 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venue2006 IEEE International Conference on Communications · 2006
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsFadingComputer scienceScheduling (production processes)ThroughputChannel (broadcasting)Computer networkTransmission (telecommunications)WirelessReal-time computingMathematical optimizationMathematicsTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we propose two analytical models for per-user throughput of an opportunistic scheduling scheme over a broadcast fading channel. For the first model, we use a piecewise linear approximation of the achievable transmission rates versus the values of Signal to Noise and Interference Ratio (SINR). We obtain the conditional average transmission rate of a mobile station, given the maximum channel quality of the other competing mobile stations. Using the probability distribution function of the maximum channel quality of the competing mobile stations, we obtain a closed form unconditional average transmission rate, i.e., per-user throughput, of a mobile station. For the second model, we use a similar approach, but with a precise model of the achievable rates. Furthermore, statistically nonidentical channels for different mobile stations are considered. Thus, the second model is more general and provides more accurate solution, but it requires more computations. The proposed models are useful for call admission control as well as performance studies of wireless networks. Simulation results are given to demonstrate the accuracy of the proposed analytical models.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.906
Threshold uncertainty score0.918

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.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.071
GPT teacher head0.318
Teacher spread0.247 · 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