Joint Energy Efficient Subchannel and Power Optimization for a Downlink NOMA Heterogeneous Network
Bibliographic record
Abstract
Non-orthogonal multiple access (NOMA) has been considered as a key technology in the fifth-generation mobile communication networks due to its superior spectrum efficiency. Since the heterogeneous network has been emerged to satisfy users' explosive data rate requirements and large connectivity of mobile Internet, implementing NOMA policy in heterogeneous networks (HetNets) has become an inevitable trend to enhance the 5G system throughput and spectrum efficiency. In this paper, we aim to maximize the entire system energy efficiency, including the macrocell and small cells, in a NOMA HetNet via subchannel allocation and power allocation. By considering the co-channel interference and cross-tier interference, the energy efficient resource allocation problem is formulated as a mixed integer nonconvex optimization problem. It is challenging to obtain the optimal solution; therefore, a suboptimal algorithm is proposed to alternatively optimize the macrocell and the small cells resource allocation. Specifically, convex relaxation and dual-decomposition techniques are exploited to optimize the subchannel allocation and power allocation. Moreover, optimal closed-form power allocation expressions are derived for small cell and macrocell user equipments by the Lagrangian approach. Simulations results show that the proposed algorithms can converge within ten iterations and can also attain higher system energy efficiency than the reference schemes.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 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.001 | 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 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".