Cross Layer Scheduling Algorithms for Downlink Multi-Antenna CDMA 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
In today's wireless communication systems, the design of efficient packet scheduling algorithms at the MAC layer is proven to have significant impact on their overall performances. In the light of this fact, we propose and compare in this paper different scheduling techniques which aim at satisfying the users' requirements in terms of both rates and delays. The considered system is a downlink multi antenna code division multiple access (MIMO-CDMA) system which assumes both traffic arrival and users' mobility. First, the MIMO-CDMA system is modeled as a weighted graph. The weight of each vertex is then updated at each time slot according to a specified scheduling rule. Finally, we solve heuristically a graph coloring problem in order to find a near- optimal scheduling decision. We evaluate through simulations the performance of the proposed algorithms and show that a cross layer design taking the benefits of both MIMO and scheduling may be efficient to address the tradeoff between system capacity and users' quality of service requirements.
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