{"title":"基于离散时间马尔可夫链的认知无线电超密集网络导频去污方法分析与实现","authors":"Subrat Kumar Sethi, 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, 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}
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 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.