Optimal Cross-Layer Resource Allocation for Critical MTC Traffic in Mixed LTE Networks
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
Machine-type communications (MTC) play an important role in implementing and enabling the Internet of Things. Long -term evolution (LTE) is a strong candidate technology for the interconnection of the MTC devices. However, to optimize LTE for MTC purposes, several issues need to be addressed. This is due to the different and diverse quality of service (QoS) requirements of MTC compared to those of human-to-human (H2H) communications. In particular, critical-MTC pose many challenges to radio resource management in LTE. They have stringent QoS requirements that need to be considered without sacrificing the QoS of the H2H traffic. In this paper, we formulate the resource allocation optimization problem from a cross-layer design perspective to consider both the QoS requirements of critical-MTC and those of H2H communications. We propose methods to handle the optimization problem to reduce the computational complexity of the optimal solution. Additionally, the performance of the proposed resource allocation algorithms is evaluated analytically. Moreover, more computationally efficient algorithms are proposed to practically implement the resource allocation process in several operational cases. Finally, the computational complexity of the proposed algorithms is analyzed. The simulations results show the superiority of the proposed algorithms and methods compared to other techniques from the literature.
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.001 | 0.001 |
| 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