Frequency-time scheduling algorithm for OFDMA systems
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.
Bibliographic record
Abstract
Frequency-time scheduling is an essential radio resource management (RRM) function in Orthogonal Frequency Division Multiple Access (OFDMA) wireless systems. In the literature, there are several OFDMA scheduling algorithms such as the Hungarian and Max-Max algorithm. However, such algorithms do not consider the multiuser diversity into account. In this paper, we propose a scheduling algorithm that exploits the multiuser diversity in both time and frequency domains. Also, the proposed algorithm utilizes the Proportional Fairness (PF) criterion to achieve fairness among users in the system. In order to support multimedia bursty traffic, our algorithm allows more than one user to share a subband in each time frame. The proposed algorithm iteratively assigns the available subbands to be shared among different users concurrently. We compare the performance of the proposed algorithm with other OFDMA scheduling algorithms in the literature. Results show that the proposed algorithm outperforms other algorithms in terms of the throughput with comparable fairness performance.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it