Abstract

The rapid development of urbanization has led to the gradual increase of urban residential density. Relatively speaking, the spectrum resources are increasingly scarce, which leads to the increasingly serious interference between communities, and the system performance is also greatly limited. Therefore, in order to improve the efficiency of spectrum resources and solve the problem of user interference between cells, the experiment combines the advantages of clustering by fast search and find of Density Peaks Clustering (DPC), and proposes a two-step clustering algorithm. This method is proposed based on the core idea of DPC after in-depth study of the downlink multi-cell orthogonal frequency division multiplexing system architecture. The proposed model is compared with Matching Pursuit (MP) algorithm and Graph-based algorithm with the sum of clustering distance Rs, 1.5⁢Rs. The results show that the two-step clustering algorithm can significantly improve the spectrum efficiency and network capacity while ensuring good quality of service under the condition of channel tension or not. In addition, the minimum SINR value of the two-step clustering algorithm can reach 75 dB. Compared with the 220 dB of the Graph-based algorithm with the clustering distance Rs, it has extremely obvious advantages. Therefore, the two-step clustering algorithm constructed in this study can effectively reduce system interference, and has certain research and application value in solving the problem of mobile communication channel resource shortage.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call