Call Admission Control Optimization in 5G in Downlink Single-Cell MISO System
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
The main goal ofNew Radio 5G (NR) mobile technology is to support three generic service categories, each with very specific requirements. The first category is enhanced Mobile Broadband (eMBB), the second category relates to massive Machine-Type Communications (mMTC), and the third category relates to ultra-Reliable Low Latency Communications (URLLC). The slicing of the radio part of 5G network access network has greatly contributed to the emergence of these three categories of service with different qualities of service. This division therefore enabled the network to reserve the necessary resources for each category of services, orthogonally, and according to the performance required. In this article, we have dealt with the problem of Call Admission Control (CAC) in 5G networks where we have considered the case of the only two categories eMBB and uRLLC, which their users are served by a single cell. We calculated the maximum eMBB users admitted into the system with guaranteed data rate, while allocating power, bandwidth, and beamforming directions to all uRLLC users whose latency requirements and reliability are always guaranteed. We only considered the downlink communication, and we used the case of the multiple-input single-output (MISO) system. This CAC problem is formulated as a minimization problem l0 which is known as NP-hard problem. We therefore chose to use Sequential Convex Programming (SCP) to find a suboptimal solution to the problem.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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