Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association

IF 8.3 2区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Communications Pub Date : 2024-10-15 DOI:10.1109/TCOMM.2024.3480972
Hao-Zhong Hou;Hong-Chen Huang;Cheng-Yeh Chen;Hung-Yun Hsieh
{"title":"Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association","authors":"Hao-Zhong Hou;Hong-Chen Huang;Cheng-Yeh Chen;Hung-Yun Hsieh","doi":"10.1109/TCOMM.2024.3480972","DOIUrl":null,"url":null,"abstract":"While Poisson Cluster Process (PCP) has been used extensively in the literature for analyzing large-scale clustered wireless networks, related work differs in terms of how the BS (Base Station) distribution and UE (User Equipment) association strategy are modeled in this context. Different from related work that places BSs via Poisson Point Process (PPP) independent of the UE distribution, we consider a more practical scenario where the BSs are located at the parent points of PCP. Furthermore, while a lot of analysis often assumes each UE to be associated with the BS at the parent point of the cluster it belongs to, such a model may result in bias for dense networks where clusters of UEs may overlap with each other. To address such a pitfall, in this work we consider “nearest-BS” association such that a UE may be associated with a nearby BS that is the parent point of another cluster. While there does exist analysis on downlink transmissions for such a network scenario, we find that analysis for uplink performance is more challenging and has yet to be developed in the literature. To proceed, we start from the analytical framework established by related work but derive new expressions for the aggregate uplink interference from different UE clusters in the network. We derive accurate analytical upper and lower bounds for the transmission success probability and we are able to arrive at a closed-form expression for the special case with a path loss exponent of 4. Furthermore, we derive the asymptotic performance bound for ultra-dense networks and investigate the problem of optimizing the area spectral efficiency (ASE) with respect to the design of the signal-to-interference-plus-noise ratio (SINR) threshold. By leveraging the closed-form expression that we have derived, the problem can be solved effectively to obtain the optimal ASE in ultra-dense networks. Evaluation results show that our analysis is correct and the derived bounds are accurate, thus motivating further investigation based on the derived results.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"73 6","pages":"4290-4306"},"PeriodicalIF":8.3000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10718318/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

While Poisson Cluster Process (PCP) has been used extensively in the literature for analyzing large-scale clustered wireless networks, related work differs in terms of how the BS (Base Station) distribution and UE (User Equipment) association strategy are modeled in this context. Different from related work that places BSs via Poisson Point Process (PPP) independent of the UE distribution, we consider a more practical scenario where the BSs are located at the parent points of PCP. Furthermore, while a lot of analysis often assumes each UE to be associated with the BS at the parent point of the cluster it belongs to, such a model may result in bias for dense networks where clusters of UEs may overlap with each other. To address such a pitfall, in this work we consider “nearest-BS” association such that a UE may be associated with a nearby BS that is the parent point of another cluster. While there does exist analysis on downlink transmissions for such a network scenario, we find that analysis for uplink performance is more challenging and has yet to be developed in the literature. To proceed, we start from the analytical framework established by related work but derive new expressions for the aggregate uplink interference from different UE clusters in the network. We derive accurate analytical upper and lower bounds for the transmission success probability and we are able to arrive at a closed-form expression for the special case with a path loss exponent of 4. Furthermore, we derive the asymptotic performance bound for ultra-dense networks and investigate the problem of optimizing the area spectral efficiency (ASE) with respect to the design of the signal-to-interference-plus-noise ratio (SINR) threshold. By leveraging the closed-form expression that we have derived, the problem can be solved effectively to obtain the optimal ASE in ultra-dense networks. Evaluation results show that our analysis is correct and the derived bounds are accurate, thus motivating further investigation based on the derived results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有最近 BS 关联的密集集群无线网络的上行链路性能分析与优化
虽然泊松聚类过程(PCP)在文献中被广泛用于分析大规模集群无线网络,但相关工作在如何在这种情况下对BS(基站)分布和UE(用户设备)关联策略进行建模方面存在差异。与将BSs通过泊松点过程(PPP)独立于UE分布的相关工作不同,我们考虑了一个更实际的场景,即BSs位于PCP的父点。此外,虽然许多分析通常假设每个UE与其所属集群父点的BS相关联,但对于UE集群可能相互重叠的密集网络,这种模型可能会导致偏差。为了解决这样一个陷阱,在这项工作中,我们考虑了“最近的BS”关联,这样一个UE可能与另一个集群的父点附近的BS相关联。虽然已有针对这种网络场景的下行传输的分析,但我们发现上行性能的分析更具挑战性,并且在文献中尚未得到发展。接下来,我们从相关工作建立的分析框架出发,推导出网络中不同UE集群上行干扰总量的新表达式。导出了传输成功率的精确解析上界和下界,并得到了路径损耗指数为4的特殊情况的封闭表达式。此外,我们推导了超密集网络的渐近性能界,并研究了优化区域频谱效率(ASE)与信噪比(SINR)阈值设计的问题。利用我们导出的封闭表达式,可以有效地解决问题,从而获得超密集网络中的最优ASE。评估结果表明,我们的分析是正确的,推导出的边界是准确的,从而激励进一步的研究基于推导出的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Communications
IEEE Transactions on Communications 工程技术-电信学
CiteScore
16.10
自引率
8.40%
发文量
528
审稿时长
4.1 months
期刊介绍: The IEEE Transactions on Communications is dedicated to publishing high-quality manuscripts that showcase advancements in the state-of-the-art of telecommunications. Our scope encompasses all aspects of telecommunications, including telephone, telegraphy, facsimile, and television, facilitated by electromagnetic propagation methods such as radio, wire, aerial, underground, coaxial, and submarine cables, as well as waveguides, communication satellites, and lasers. We cover telecommunications in various settings, including marine, aeronautical, space, and fixed station services, addressing topics such as repeaters, radio relaying, signal storage, regeneration, error detection and correction, multiplexing, carrier techniques, communication switching systems, data communications, and communication theory. Join us in advancing the field of telecommunications through groundbreaking research and innovation.
期刊最新文献
Novel Transform Based Optimization for Resource Allocation and Task Offloading in Communication Networks A Novel Cross-Entropy Receiver for Random Time-Hopping Covert Satellite Systems Rydberg-Atom-Based Superdirective Receivers: Array Modeling and Performance Analysis Resource Allocation in RIS-assisted Integrated Sensing, Communication, and Computation Network Coarse-to-Fine Doppler Compensation in 6G VLEO: Dual-Head Temporal Convolutional Network Acquisition with CP-Aided Tracking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1