基于离散时间马尔可夫链的认知无线电超密集网络导频去污方法分析与实现

IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Subrat Kumar Sethi, Arunanshu Mahapatro
{"title":"基于离散时间马尔可夫链的认知无线电超密集网络导频去污方法分析与实现","authors":"Subrat Kumar Sethi,&nbsp;Arunanshu Mahapatro","doi":"10.1016/j.comcom.2025.108246","DOIUrl":null,"url":null,"abstract":"<div><div>In the context of beyond 5G (B5G) systems, the deployment of ultra-dense networks (UDNs) equipped with a large number of base-station antennas holds the promise of achieving high spectral efficiency (SE) through Cognitive Radio Network (CRN) technology. However, this approach introduce the issue of pilot contamination (PC), stemming from the reuse of pilots in adjacent cells, which has a detrimental impact on channel estimation and overall network performance. To address this issue comprehensively, we propose the SD-GraW-PD scheme for CRNs. Our scheme begins by categorizing users into two groups: cell-centered and cell-edged users. To further mitigate the effects of PC, we introduce a Discrete Time Markov Chain (DTMC)-based approach that leverages mutually orthogonal Graeco-Latin squares matrix pilot allocation. Additionally, we apply DTMC analysis to implement the Weighted Graph-Coloring Pilot Decontamination (WGC-PD) technique, enhancing the decontamination process, particularly for cell-edged users. Through extensive numerical simulations, we evaluate the proposed methodology. The results unequivocally demonstrate significant improvements in network performance, including enhancements in uplink achievable rate and SINR, in comparison to existing methods. Our DTMC-based approach emerges as an efficient and effective solution to the persistent PC problem within CR-based UDNs, offering promising prospects for achieving higher SE in the context of B5G systems.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"241 ","pages":"Article 108246"},"PeriodicalIF":4.3000,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis and implementation of Discrete Time Markov Chain based method for pilot decontamination in cognitive radio based ultra-dense networks\",\"authors\":\"Subrat Kumar Sethi,&nbsp;Arunanshu Mahapatro\",\"doi\":\"10.1016/j.comcom.2025.108246\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the context of beyond 5G (B5G) systems, the deployment of ultra-dense networks (UDNs) equipped with a large number of base-station antennas holds the promise of achieving high spectral efficiency (SE) through Cognitive Radio Network (CRN) technology. However, this approach introduce the issue of pilot contamination (PC), stemming from the reuse of pilots in adjacent cells, which has a detrimental impact on channel estimation and overall network performance. To address this issue comprehensively, we propose the SD-GraW-PD scheme for CRNs. Our scheme begins by categorizing users into two groups: cell-centered and cell-edged users. To further mitigate the effects of PC, we introduce a Discrete Time Markov Chain (DTMC)-based approach that leverages mutually orthogonal Graeco-Latin squares matrix pilot allocation. Additionally, we apply DTMC analysis to implement the Weighted Graph-Coloring Pilot Decontamination (WGC-PD) technique, enhancing the decontamination process, particularly for cell-edged users. Through extensive numerical simulations, we evaluate the proposed methodology. The results unequivocally demonstrate significant improvements in network performance, including enhancements in uplink achievable rate and SINR, in comparison to existing methods. Our DTMC-based approach emerges as an efficient and effective solution to the persistent PC problem within CR-based UDNs, offering promising prospects for achieving higher SE in the context of B5G systems.</div></div>\",\"PeriodicalId\":55224,\"journal\":{\"name\":\"Computer Communications\",\"volume\":\"241 \",\"pages\":\"Article 108246\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0140366425002038\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366425002038","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在超5G (B5G)系统的背景下,部署配备大量基站天线的超密集网络(udn)有望通过认知无线电网络(CRN)技术实现高频谱效率(SE)。然而,这种方法引入了导频污染(PC)的问题,源于相邻小区中导频的重用,这对信道估计和整体网络性能有不利影响。为了全面解决这一问题,我们提出了crn的SD-GraW-PD方案。我们的方案首先将用户分为两组:以小区为中心的用户和以小区为边缘的用户。为了进一步减轻PC的影响,我们引入了一种基于离散时间马尔可夫链(DTMC)的方法,该方法利用相互正交的希腊-拉丁方矩阵导频分配。此外,我们应用DTMC分析来实现加权图着色中导去污(WGC-PD)技术,增强去污过程,特别是对于蜂窝边缘用户。通过广泛的数值模拟,我们评估了所提出的方法。结果明确表明,与现有方法相比,网络性能有了显著改善,包括上行可实现速率和信噪比的增强。我们基于dmc的方法是解决基于cr的udn中持续存在的PC问题的有效解决方案,为在B5G系统中实现更高的SE提供了有希望的前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis and implementation of Discrete Time Markov Chain based method for pilot decontamination in cognitive radio based ultra-dense networks
In the context of beyond 5G (B5G) systems, the deployment of ultra-dense networks (UDNs) equipped with a large number of base-station antennas holds the promise of achieving high spectral efficiency (SE) through Cognitive Radio Network (CRN) technology. However, this approach introduce the issue of pilot contamination (PC), stemming from the reuse of pilots in adjacent cells, which has a detrimental impact on channel estimation and overall network performance. To address this issue comprehensively, we propose the SD-GraW-PD scheme for CRNs. Our scheme begins by categorizing users into two groups: cell-centered and cell-edged users. To further mitigate the effects of PC, we introduce a Discrete Time Markov Chain (DTMC)-based approach that leverages mutually orthogonal Graeco-Latin squares matrix pilot allocation. Additionally, we apply DTMC analysis to implement the Weighted Graph-Coloring Pilot Decontamination (WGC-PD) technique, enhancing the decontamination process, particularly for cell-edged users. Through extensive numerical simulations, we evaluate the proposed methodology. The results unequivocally demonstrate significant improvements in network performance, including enhancements in uplink achievable rate and SINR, in comparison to existing methods. Our DTMC-based approach emerges as an efficient and effective solution to the persistent PC problem within CR-based UDNs, offering promising prospects for achieving higher SE in the context of B5G systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
×
引用
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学术官方微信