Optimizing power allocation for URLLC-D2D in 5G networks with Rician fading channel.

IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
PeerJ Computer Science Pub Date : 2025-02-18 eCollection Date: 2025-01-01 DOI:10.7717/peerj-cs.2712
Owais Muhammad, Hong Jiang, Muhammad Bilal, Mushtaq Muhammad Umer
{"title":"Optimizing power allocation for URLLC-D2D in 5G networks with Rician fading channel.","authors":"Owais Muhammad, Hong Jiang, Muhammad Bilal, Mushtaq Muhammad Umer","doi":"10.7717/peerj-cs.2712","DOIUrl":null,"url":null,"abstract":"<p><p>The rapid evolution of wireless technologies within the 5G network brings significant challenges in managing the increased connectivity and traffic of mobile devices. This enhanced connectivity brings challenges for base stations, which must handle increased traffic and efficiently serve a growing number of mobile devices. One of the key solutions to address these challenges is integrating device-to-device (D2D) communication with ultra-reliable and low-latency communication (URLLC). This study examines the impact of the Rician fading channel on the performance of D2D communication under URLLC. It addresses the critical problem of optimizing power allocation to maximize the minimum data rate in D2D communication. A significant challenge arises due to interference issues, as the problem of maximizing the minimum data rate is non-convex, which leads to high computational complexity. This complexity makes it difficult to derive optimal solutions efficiently. To address this challenge, we introduce an algorithm that is based on derivatives to find the optimal power allocation. Comparisons are made with the branch and bound (B&B) algorithm, heuristic algorithm, and particle swarm optimization (PSO) algorithm. Our proposed algorithm improves power allocation performance and also achieves faster execution with lower computational complexity compared to the B&B, PSO, and heuristic algorithms.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e2712"},"PeriodicalIF":3.5000,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11888938/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.2712","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The rapid evolution of wireless technologies within the 5G network brings significant challenges in managing the increased connectivity and traffic of mobile devices. This enhanced connectivity brings challenges for base stations, which must handle increased traffic and efficiently serve a growing number of mobile devices. One of the key solutions to address these challenges is integrating device-to-device (D2D) communication with ultra-reliable and low-latency communication (URLLC). This study examines the impact of the Rician fading channel on the performance of D2D communication under URLLC. It addresses the critical problem of optimizing power allocation to maximize the minimum data rate in D2D communication. A significant challenge arises due to interference issues, as the problem of maximizing the minimum data rate is non-convex, which leads to high computational complexity. This complexity makes it difficult to derive optimal solutions efficiently. To address this challenge, we introduce an algorithm that is based on derivatives to find the optimal power allocation. Comparisons are made with the branch and bound (B&B) algorithm, heuristic algorithm, and particle swarm optimization (PSO) algorithm. Our proposed algorithm improves power allocation performance and also achieves faster execution with lower computational complexity compared to the B&B, PSO, and heuristic algorithms.

在具有里氏衰落信道的 5G 网络中优化 URLLC-D2D 的功率分配。
5G网络中无线技术的快速发展为管理不断增长的移动设备连接和流量带来了重大挑战。这种增强的连接给基站带来了挑战,基站必须处理不断增加的流量,并有效地为数量不断增加的移动设备提供服务。解决这些挑战的关键解决方案之一是将设备对设备(D2D)通信与超可靠和低延迟通信(URLLC)集成在一起。本文研究了在URLLC条件下,衰落信道对D2D通信性能的影响。它解决了D2D通信中优化功率分配以使最小数据速率最大化的关键问题。由于最大化最小数据速率的问题是非凸的,这导致了很高的计算复杂性,因此干扰问题带来了重大挑战。这种复杂性使得很难有效地推导出最优解。为了解决这一挑战,我们引入了一种基于导数的算法来寻找最优功率分配。并与分支定界(B&B)算法、启发式算法和粒子群优化(PSO)算法进行了比较。与B&B、PSO和启发式算法相比,我们提出的算法提高了功率分配性能,并且实现了更快的执行速度和更低的计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
PeerJ Computer Science
PeerJ Computer Science Computer Science-General Computer Science
CiteScore
6.10
自引率
5.30%
发文量
332
审稿时长
10 weeks
期刊介绍: PeerJ Computer Science is the new open access journal covering all subject areas in computer science, with the backing of a prestigious advisory board and more than 300 academic editors.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信