Research on D2D Communication Resource Allocation Algorithm Based on Graph Coloring-SGADIA
Device-to-device (D2D) communication enhances system throughput and alleviates the load on the network core by utilizing the spectrum resources allocated to cellular users, and has become one of the key technologies of 6G. Aiming at the problem of serious user interference, this study introduces a new D2D resource allocation algorithm that combines graph coloring technology and a soft-greedy asynchronous distributed interference avoidance method. First, the interference graph between D2D users is constructed, the priority of D2D users is calculated, and D2D users are grouped with the help of graph coloring; then Different groups of D2D users and cellular users are mapped into a bipartite graph, which is solved using the KM algorithm; Finally, the initial channel allocation approach is refined through the application of a soft greedy distributed asynchronous interference mitigation algorithm. Based on simulation findings, the method presented in this study can mitigate the effects of channel sharing among D2D users, enhance spectrum efficiency, and significantly reduce the system's overall interference.
Authors
- Lingqi Meng (ORCID: https://orcid.org/0000-0002-2885-568X)
- Yijun Wang (ORCID: https://orcid.org/0000-0002-2904-8345)
- Jing Guo (ORCID: https://orcid.org/0009-0002-7937-9182)
- Dongyv Xv
Institutions
- Changchun University of Science and Technology (CN)
Publication Details
- Published
- 2024-09-27
- DOI
- https://doi.org/10.1109/eiecs63941.2024.10800281
- Primary Topic
- Advanced Computing and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00