Joint User Pairing, Mode Selection, and Power Control for D2D-Capable Cellular Networks Enhanced by Nonorthogonal Multiple Access
Bibliographic record
Abstract
Nonorthogonal multiple access (NOMA) and device-to-device (D2D) are two promising technologies that have great potential in improving user connectivity. In this paper, we incorporate NOMA into the D2D-capable cellular networks and propose a new NOMA-aided D2D access scheme. In the proposed scheme, the D2D users (DUEs) can operate in four spectrum-sharing modes, which are the extension of the traditional underlay mode. To fully exploit the advantages of the NOMA-and-D2D integrated framework, we formulate a connectivity-maximization problem by jointly considering user pairing, mode selection, and power control under the constraints of the decoding thresholds of cellular users and DUEs. Based on the graph theory, we devise an efficient algorithm with polynomial complexity to solve the formulated problem optimally. We first analytically obtain the optimal transmission power and spectrum-sharing mode for every possible user pair through a graphical method. Based on the power control and mode selection policies, we transform the user pairing problem into a min-cost max-flow problem which can be tackled by the Ford-Fulkerson algorithm. Finally, simulation results indicate that the NOMA-aided D2D access scheme outperforms the traditional underlay mode, and the proposed algorithm yields a large performance gain in comparison with other schemes in terms of user connectivity and power consumption.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".