Mobile communication channel resource allocation technology in interference environment based on clustering algorithm

IF 0.5 Q4 ENGINEERING, MULTIDISCIPLINARY
Yuan Chen, Wenqi Cao, Wenjie Xu, Juan Li
{"title":"Mobile communication channel resource allocation technology in interference environment based on clustering algorithm","authors":"Yuan Chen, Wenqi Cao, Wenjie Xu, Juan Li","doi":"10.3233/jcm-226905","DOIUrl":null,"url":null,"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.","PeriodicalId":45004,"journal":{"name":"Journal of Computational Methods in Sciences and Engineering","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Methods in Sciences and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/jcm-226905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

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.
基于聚类算法的干扰环境下移动通信信道资源分配技术
城市化的快速发展导致了城市居住密度的逐渐增加。相对而言,频谱资源越来越稀缺,导致社区之间的干扰越来越严重,系统性能也受到极大限制。因此,为了提高频谱资源的利用效率,解决小区间用户干扰的问题,本实验结合了密度峰值聚类(DPC)快速搜索和查找的聚类优势,提出了一种两步聚类算法。该方法是在深入研究下行链路多小区正交频分复用系统架构后,基于DPC的核心思想提出的。将所提出的模型与匹配寻踪(MP)算法和基于图的算法进行比较,聚类距离之和Rs为1.5Rs。结果表明,在信道紧张与否的情况下,两步聚类算法可以显著提高频谱效率和网络容量,同时确保良好的服务质量。此外,两步聚类算法的最小SINR值可以达到75dB。与聚类距离为Rs的基于图的220dB算法相比,它具有极其明显的优势。因此,本研究构建的两步聚类算法能够有效地减少系统干扰,在解决移动通信信道资源短缺问题方面具有一定的研究和应用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
152
期刊介绍: The major goal of the Journal of Computational Methods in Sciences and Engineering (JCMSE) is the publication of new research results on computational methods in sciences and engineering. Common experience had taught us that computational methods originally developed in a given basic science, e.g. physics, can be of paramount importance to other neighboring sciences, e.g. chemistry, as well as to engineering or technology and, in turn, to society as a whole. This undoubtedly beneficial practice of interdisciplinary interactions will be continuously and systematically encouraged by the JCMSE.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信