A Critical MTC Resource Allocation Approach for LTE Networks With Finite Blocklength Codes
Bibliographic record
Abstract
Critical machine-type communications (cMTC) are targeted as a major use case in the design of the fifth generation (5G) cellular systems. In this regard, the third-generation partnership project (3GPP) has introduced several enhancements to evolve the LTE standard to meet the 5G requirements. Shortened transmission time intervals (sTTIs) are considered one of the most significant improvements proposed to satisfy the stringent latency requirements of cMTC. However, this entails several challenges to the resource allocation and scheduling process. In this paper, we address the resource allocation and scheduling of cMTC in LTE networks. The impact on the conventional human-type communications (HTC) is considered while adopting a puncturing scheduling technique. In addition, the reliability of the cMTC is ensured by utilizing the finite blocklength coding analysis to model the transmission errors and the effective bandwidth and effective capacity concepts to guarantee the queuing delay statistics of the cMTC packets. Moreover, we propose matching theory-based computationally efficient algorithms to solve the formulated optimal resource allocation problems with reduced complexity. The proposed methods are analyzed from a practical perspective. Extensive simulations show a close-to-optimal performance of the proposed schemes while outperforming other scheduling algorithms 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.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".