Massive IoT Access With NOMA in 5G Networks and Beyond Using Online Competitiveness and Learning
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
This article studies the problem of online user grouping, scheduling, and power allocation for massive Internet of Things (IoT) access in beyond 5G networks using nonorthogonal multiple access (NOMA). NOMA has been identified as a promising technology to accommodate a large number of devices using a limited number of radio resources. In this work, the objective is to maximize the number of served devices while allocating their transmission powers such that their real-time requirements as well as their limited operating energy are respected. First, we formulate the problem as a mixed-integer nonlinear program (MINLP) that can be transformed to MILP for some special cases. Second, we study its NP-hardness in different cases. Then, by dividing the problem into multiple NOMA grouping and scheduling subproblems, an efficient online competitive algorithm is proposed to solve each subproblem. Next, we show how to use the proposed online algorithm as a black box and how to combine the obtained solutions to each subproblem in a reinforcement learning setting to obtain the power allocation for each NOMA group. Our analyses are supplemented by simulation results to illustrate the performance of the proposed algorithms in comparison to optimal and state-of-the-art methods.
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.000 | 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