Modelling and Development of a Radio Resource Control and Scheduling Algorithm for Long-Term Evolution (LTE) Uplink
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
Modern radio communication services transmit signals from an earth station to a high-altitude station, space station or a space radio system via a feeder link while in Global Systems for Mobile Communication (GSM) and computer networks, the radio uplink transmit from cell phones to base station linking the network core to the communication interphase via an upstream facility. Hitherto, the Single-Carrier Frequency Division Multiple Access (SC-FDMA) has been adopted for uplink access in the Long-Term Evolution (LTE) scheme by the 3GPP. In this journal, the LTE uplink radio resource allocation is addressed as an optimization problem, where the desired solution is the mapping of the schedulable UE to schedulable Resource Blocks (RBs) that maximizes the proportional fairness metric. The particle swarm optimization (PSO) has been employed for this research. PSO is an algorithm that is very easy to implement to solve real time optimization problems and has fewer parameters to adjust when compared to other evolutionary algorithms. The proposed scheme was found to outperform the First Maximum Expansion (FME) and Recursive Maximum Expansion (RME) in terms of simulation time and fairness while maintaining the throughput.
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.001 | 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