QoS-Aware Energy and Jitter-Efficient Downlink Predictive Scheduler for Heterogeneous Traffic LTE Networks
Bibliographic record
Abstract
Energy-efficient communications have become one fundamental aspect for today's cutting-edge wireless technologies due to its valuable impact on the environment. In this paper, we augment our earlier study for the user equipment's (UE) energy efficiency (EE) in the long-term evolution (LTE) downlink by looking at real-time heterogeneous traffic QoS requirements. In particular, we utilize the previously proposed cloud radio access network (C-RAN) and ray tracing (RT)-based scheduling model to optimize both of the EE and the packet delay jitter for real-time applications with fixed packet delay budget subject to other traffic types requirements. Using the utility-based scheduling approach, we formulate the resource allocation problem as a weighted sum binary integer programming (BIP) problem. Due to the inherent complexity of the problem formulation which hinders finding its solution directly, four heuristic algorithms are proposed to solve the optimization problem. Numerical simulations are conducted on three different traffic types each belonging to one of the popular QoS classes; best-effort class, rate, and delay-constrained classes. The obtained results demonstrate a substantial improvement in the system's performance achieved by our proposed schemes compared to other existing schemes.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".