Efficient Resource Allocation in SCMA-Enabled Device-to-Device Communication for 5G Networks
Bibliographic record
Abstract
According to advanced wireless network standards, Device-to-device based communication underlaid conventional cellular network is considered a promising technology to improve the network performance. Precisely, this hybrid architecture provides an efficient resource allocation for cellular and D2D users while increasing the flexible utilization of the spectrum resources. Recently, the sparse code multiple access (SCMA) has been proposed as an efficient non-orthogonal multiple access technology for the 5G network paradigm. The SCMA scheme enhances the spectral efficiency, supports a massive connectivity, and diverses applications by enabling system overloading. Thus, in this paper, SCMA technology is applied to a D2D enabled cellular network, targeted at utilizing the overloading feature of the SCMA scheme to support a massive device connectivity while enhancing the overall network performance. The SCMA scheme is implemented to jointly optimize the codebook and power allocation in the downlink D2D enabled cellular network, with the aim to maximize the system data rate. This joint optimization problem is solved by decomposing the original problem into two sub-problems: codebook allocation and power allocation. For the codebook allocation, the rate aware codebook selection scheme for D2D system (RACBS-D2D) is proposed using conflict graph. For the power allocation solution, a geometric water-filling (GWF) method is utilized to propose the iterative GWF-based power allocation (IGWFPA) scheme. The performance of the proposed schemes is evaluated through simulations that reveal the benefits of the proposed solutions under different scenarios.
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.000 | 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.000 |
| 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".