Pilot power optimization in scalable user-centric HC-RANs for future IoT and IIoT applications

IF 1.8 4区 计算机科学 Q3 TELECOMMUNICATIONS Annals of Telecommunications Pub Date : 2024-02-16 DOI:10.1007/s12243-024-01014-8
Hareesh Ayanampudi, Ravindra Dhuli
{"title":"Pilot power optimization in scalable user-centric HC-RANs for future IoT and IIoT applications","authors":"Hareesh Ayanampudi, Ravindra Dhuli","doi":"10.1007/s12243-024-01014-8","DOIUrl":null,"url":null,"abstract":"<p>In this paper, a scalable user-centric HC-RAN is taken into consideration, where each remote radio head (RRH) serves user equipments (UEs) over the same time/frequency resources by using time division duplex (TDD) mode. Network scalability results in the front-haul load and computational complexity at the baseband unit (BBU) pool remaining constant irrespective of the number of UEs in the network. During the channel estimation phase, each RRH will acquire the channel state information (CSI) based on the received pilot signals from the UEs. With the available CSI, each RRH will decode/precode the desired UE information in uplink and downlink, respectively. However, in ultra-dense networks, pilot contamination is a major limitation that hugely impacts the system’s performance. To address this, we proposed an uplink pilot power optimization algorithm by considering the inter-user interference due to pilot sharing and RRH selection. In this algorithm, the pilot power coefficients are designed in such a way as to decrease the mean square error (MSE) of the channel estimates. To achieve this, we used the successive convex approximation method. Moreover, we derived a closed-form expression for achievable spectral efficiency (SE) per UE, which will be valid for any pilot/data power optimization and RRH selection scheme. The results show that the proposed algorithm significantly improves the system performance in the channel estimation phase and will be more suitable for urban environments.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"17 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Telecommunications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12243-024-01014-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a scalable user-centric HC-RAN is taken into consideration, where each remote radio head (RRH) serves user equipments (UEs) over the same time/frequency resources by using time division duplex (TDD) mode. Network scalability results in the front-haul load and computational complexity at the baseband unit (BBU) pool remaining constant irrespective of the number of UEs in the network. During the channel estimation phase, each RRH will acquire the channel state information (CSI) based on the received pilot signals from the UEs. With the available CSI, each RRH will decode/precode the desired UE information in uplink and downlink, respectively. However, in ultra-dense networks, pilot contamination is a major limitation that hugely impacts the system’s performance. To address this, we proposed an uplink pilot power optimization algorithm by considering the inter-user interference due to pilot sharing and RRH selection. In this algorithm, the pilot power coefficients are designed in such a way as to decrease the mean square error (MSE) of the channel estimates. To achieve this, we used the successive convex approximation method. Moreover, we derived a closed-form expression for achievable spectral efficiency (SE) per UE, which will be valid for any pilot/data power optimization and RRH selection scheme. The results show that the proposed algorithm significantly improves the system performance in the channel estimation phase and will be more suitable for urban environments.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向未来物联网和 IIoT 应用的可扩展、以用户为中心的 HC-RAN 中的试点功率优化
本文考虑了一种以用户为中心的可扩展 HC-RAN,其中每个远程无线电头(RRH)通过使用时分双工(TDD)模式在相同的时间/频率资源上为用户设备(UE)提供服务。无论网络中的 UE 数量多少,网络的可扩展性都会导致基带单元(BBU)池的前端负荷和计算复杂度保持不变。在信道估计阶段,每个 RRH 将根据从 UE 接收到的先导信号获取信道状态信息(CSI)。利用可用的 CSI,每个 RRH 将在上行和下行链路中分别对所需的 UE 信息进行解码/预编码。然而,在超密集网络中,先导污染是一个主要限制因素,会严重影响系统性能。针对这一问题,我们提出了一种上行链路先导功率优化算法,该算法考虑了由于先导共享和 RRH 选择造成的用户间干扰。在该算法中,先导功率系数的设计方式是降低信道估计的均方误差(MSE)。为此,我们采用了连续凸近似法。此外,我们还推导出了每个 UE 可实现频谱效率 (SE) 的闭式表达式,该表达式适用于任何先导/数据功率优化和 RRH 选择方案。结果表明,所提出的算法能显著提高信道估计阶段的系统性能,而且更适用于城市环境。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Telecommunications
Annals of Telecommunications 工程技术-电信学
CiteScore
5.20
自引率
5.30%
发文量
37
审稿时长
4.5 months
期刊介绍: Annals of Telecommunications is an international journal publishing original peer-reviewed papers in the field of telecommunications. It covers all the essential branches of modern telecommunications, ranging from digital communications to communication networks and the internet, to software, protocols and services, uses and economics. This large spectrum of topics accounts for the rapid convergence through telecommunications of the underlying technologies in computers, communications, content management towards the emergence of the information and knowledge society. As a consequence, the Journal provides a medium for exchanging research results and technological achievements accomplished by the European and international scientific community from academia and industry.
期刊最新文献
Editorial of 6GNet 2023 special issue On the (in)efficiency of fuzzing network protocols Investigation of LDPC codes with interleaving for 5G wireless networks Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism Joint MEC selection and wireless resource allocation in 5G RAN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1