Joint Optimization of BS Clustering and Power Control for NOMA-Enabled CoMP Transmission in Dense Cellular Networks
Bibliographic record
Abstract
Non-orthogonal multiple access (NOMA)-enabled coordinated multipoint (CoMP) transmission has great potential in balancing spectrum utilization and interference mitigation in dense cellular networks. However, NOMA reforms the spectrum sharing policy of CoMP transmission due to introducing additional interference among coordinated base stations (BSs), which deteriorates the CoMP transmission rate. In this paper, we investigate the joint optimization of BS clustering and power control for NOMA-enabled CoMP transmission in dense cellular networks to maximize system sum-rate. We first characterize the impact of interference among coordinated BSs on CoMP transmission rate and find that the BS clustering is dependent on NOMA user grouping and restricted by the NOMA decoding condition. We then derive a tight lower bound on the system sum-rate and exploit it to design a joint BS clustering and power control scheme. Specifically, a power control algorithm is designed by a penalty convex-concave procedure to satisfy the NOMA decoding condition and users' rate requirements. A BS clustering algorithm based on successive convex approximation is designed to iteratively update the BS clustering and NOMA user grouping to increase system sum-rate. Finally, two algorithms are alternately performed until all users successfully access and the system sum-rate converges. Simulation results show that the proposed scheme can efficiently alleviate interference among coordinated BSs to improve system sum-rate and spectrum efficiency of NOMA-enabled CoMP transmission even under high user density.
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.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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 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".