Resource Allocation for Device-to-Device (D2D) Communications of Uplink Multi-Cell Networks
Bibliographic record
Abstract
Device-to-Device (D2D) communications have attracted great attention in the underlaying cellular networks since it a promising way to improve the capacity, energy efficiency, spectral and latency performance of next-generation wireless networks. In order to alleviate the interference caused by D2D user equipment (DUE) and cellular user-equipment (CUE) in uplink multi-cell networks, the intra-cell and inter-cell interference are considered in this work to improve performance for D2D communication underlaying cellular network. This paper proposes a resource allocation scheme to formulate the resource allocation problem through optimization of the utility function, which eventually reflects the system performance concerning network throughput. The formulated optimization problem of maximizing network throughput while guaranteeing predefined service levels to cellular users is non-convex and hence intractable. Thus, the original problem is broken down into two stages. The first stage is the admission control of D2D users while the second one is the power control for each admissible D2D pair and its reuse partner. Our simulation results have indicated that the proposed scheme can offer near-optimal performance and outperforms the algorithms in the literature, in achievable throughput.
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.000 |
| 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".