MétaCan
Menu
Back to cohort
Record W2076569610 · doi:10.1109/vetecf.2009.5378812

Cross-Layer Scheduling for OFDMA Amplify-and-Forward Relay Networks

2009· article· en· W2076569610 on OpenAlexaff
Derrick Wing Kwan Ng, Robert Schober

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsGoodputComputer scienceSubcarrierOrthogonal frequency-division multiple accessOrthogonal frequency-division multiplexingRelayScheduling (production processes)Frequency-division multiple accessTelecommunications linkComputer networkPhysical layerChannel state informationFadingChannel (broadcasting)Power (physics)ThroughputWirelessMathematical optimizationTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we consider cross-layer scheduling for the downlink of amplify-and-forward (AF) relay assisted orthogonal frequency division multiple access (OFDMA) networks. The proposed cross-layer design takes into account the effects of imperfect channel state information at transmitter (CSIT) in slow fading. The rate adaptation, power adaptation, and subcarrier allocation policies are optimized to maximize the system goodput (bits/s/Hz successfully received by the mobiles). The optimization problem is solved by using dual decomposition resulting in a highly scalable distributed resource allocation algorithm. Simulation results illustrate that the proposed distributed cross-layer scheduler requires only a small number of iterations to achieves practically the same performance as the optimal centralized scheduler.

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 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: Methods · Consensus signal: none
Teacher disagreement score0.959
Threshold uncertainty score0.417

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.049
GPT teacher head0.333
Teacher spread0.284 · 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 teacher head, 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

Citations9
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207