A Novel Wireless Channel Clustering Algorithm Based on Robust Mean-Shift

IF 10.7 1区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Yuning Yu;Guangzheng Jing;Jingxiang Hong;José Rodríguez-Piñeiro;Xuefeng Yin
{"title":"A Novel Wireless Channel Clustering Algorithm Based on Robust Mean-Shift","authors":"Yuning Yu;Guangzheng Jing;Jingxiang Hong;José Rodríguez-Piñeiro;Xuefeng Yin","doi":"10.1109/TWC.2025.3546457","DOIUrl":null,"url":null,"abstract":"Clustering characterizes the grouping of multipath components (MPCs) in radio channels. Accurate clustering is a prerequisite for cluster-based channel characterization and sensing in the beyond fifth-generation (B5G) and sixth-generation (6G) communication. However, existing clustering algorithms commonly depend on thresholds and initializations, and are not fully consistent with the characteristics of MPC distributions in the radio channel. Additionally, clustering based on power spectrum has not been thoroughly researched. In this paper, we propose a unified clustering method named power-weighted nearest-neighbor robust mean-shift (MP-NN-RMS) algorithm, which is a kernel density estimation (KDE)-based method. The K-nearest neighbor (KNN) kernel is utilized to adapt to the changes in local density. Two variants of this clustering method for the power spectrum and MPCs are provided. Both simulation and measurement-based verifications demonstrate the effectiveness of the proposed algorithms. Compared with traditional clustering methods, the proposed algorithm can achieve more accurate and robust clustering results without requiring prior information of predefined parameters or models. Moreover, mathematical proof on the convergence guarantees the rationality of the proposed algorithm. This advancement is beneficial for the development of future wireless communication systems.","PeriodicalId":13431,"journal":{"name":"IEEE Transactions on Wireless Communications","volume":"24 6","pages":"5213-5226"},"PeriodicalIF":10.7000,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Wireless Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10916601/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Clustering characterizes the grouping of multipath components (MPCs) in radio channels. Accurate clustering is a prerequisite for cluster-based channel characterization and sensing in the beyond fifth-generation (B5G) and sixth-generation (6G) communication. However, existing clustering algorithms commonly depend on thresholds and initializations, and are not fully consistent with the characteristics of MPC distributions in the radio channel. Additionally, clustering based on power spectrum has not been thoroughly researched. In this paper, we propose a unified clustering method named power-weighted nearest-neighbor robust mean-shift (MP-NN-RMS) algorithm, which is a kernel density estimation (KDE)-based method. The K-nearest neighbor (KNN) kernel is utilized to adapt to the changes in local density. Two variants of this clustering method for the power spectrum and MPCs are provided. Both simulation and measurement-based verifications demonstrate the effectiveness of the proposed algorithms. Compared with traditional clustering methods, the proposed algorithm can achieve more accurate and robust clustering results without requiring prior information of predefined parameters or models. Moreover, mathematical proof on the convergence guarantees the rationality of the proposed algorithm. This advancement is beneficial for the development of future wireless communication systems.
一种基于鲁棒Mean-Shift的无线信道聚类算法
聚类是无线电信道中多径组件(mpc)分组的特征。准确的聚类是第五代(B5G)和第六代(6G)通信中基于聚类的信道表征和传感的先决条件。然而,现有的聚类算法通常依赖于阈值和初始化,并不完全符合无线信道中MPC分布的特征。此外,基于功率谱的聚类还没有得到深入的研究。本文提出了一种基于核密度估计(KDE)的统一聚类方法——幂加权最近邻鲁棒均值偏移(MP-NN-RMS)算法。利用k近邻核来适应局部密度的变化。给出了功率谱和MPCs聚类方法的两种变体。仿真和基于测量的验证都证明了所提出算法的有效性。与传统的聚类方法相比,该算法不需要预定义参数或模型的先验信息,可以获得更准确、鲁棒的聚类结果。此外,对算法的收敛性进行了数学证明,保证了算法的合理性。这一进展对未来无线通信系统的发展是有益的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
18.60
自引率
10.60%
发文量
708
审稿时长
5.6 months
期刊介绍: The IEEE Transactions on Wireless Communications is a prestigious publication that showcases cutting-edge advancements in wireless communications. It welcomes both theoretical and practical contributions in various areas. The scope of the Transactions encompasses a wide range of topics, including modulation and coding, detection and estimation, propagation and channel characterization, and diversity techniques. The journal also emphasizes the physical and link layer communication aspects of network architectures and protocols. The journal is open to papers on specific topics or non-traditional topics related to specific application areas. This includes simulation tools and methodologies, orthogonal frequency division multiplexing, MIMO systems, and wireless over optical technologies. Overall, the IEEE Transactions on Wireless Communications serves as a platform for high-quality manuscripts that push the boundaries of wireless communications and contribute to advancements in the field.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信