Efficient resource allocation for hybrid nonorthogonal multiple access based heterogeneous networks beyond fifth‐generation
Bibliographic record
Abstract
Abstract Fifth‐generation (5G) and future beyond fifth‐generation (B5G) networks will require immense capacity due to the high rise in the number of multimedia applications and mobile devices. The heterogeneous networks (HetNets) in 5G and B5G can increase the heterogeneity and network throughput because macro base station‐only (MBS‐only) networks cannot satisfy the drastic increase in capacity demands. Hybrid nonorthogonal multiple access (H‐NOMA) can accommodate the increasing number of multimedia applications and mobile devices in 5G and B5G. H‐NOMA in B5G can also improve spectral efficiency. Before this, the researchers had not considered user clustering with H‐NOMA in HetNets. This article investigates the user clustering with downlink H‐NOMA in HetNet to maximize the network throughput in 5G and B5G. The formulated mathematical problem optimizes the considered key performance indicators (KPIs), that is, users admission in clusters, users association with base stations, power allocation to users, and network throughput. At the same time, it also satisfies the minimum transmit power and data rate requirements of users. The formulated problem is a mixed‐integer nonlinear programming (MINLP) problem. We have proposed an ‐optimal algorithm, that is, outer approximation algorithm (OAA) to solve the MINLP problem because the complexity of the optimal exhaustive search algorithm (ESA) increases exponentially with an increase in the number of users. H‐NOMA with user clustering in HetNet is evaluated with extensive simulations to show its effectiveness regarding network throughput in 5G and B5G. We have also considered the proposed framework in the MBS‐only network and compared its performance with HetNet. The results verify that the proposed framework in HetNet performs better than the MBS‐only network. The complexity of the ‐optimal algorithm is calculated that gives ‐optimal results within . We have also made a complexity analysis of the proposed OAA and ESA and concluded that the complexity of the proposed OAA algorithm is less than the ESA.
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 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.001 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".