基于注意力的非正交多址SIC排序与功率分配

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Mobile Computing Pub Date : 2024-09-30 DOI:10.1109/TMC.2024.3470828
Liang Huang;Bincheng Zhu;Runkai Nan;Kaikai Chi;Yuan Wu
{"title":"基于注意力的非正交多址SIC排序与功率分配","authors":"Liang Huang;Bincheng Zhu;Runkai Nan;Kaikai Chi;Yuan Wu","doi":"10.1109/TMC.2024.3470828","DOIUrl":null,"url":null,"abstract":"Non-orthogonal multiple access (NOMA) emerges as a superior technology for enhancing spectral efficiency, reducing latency, and improving connectivity compared to orthogonal multiple access. In NOMA networks, successive interference cancellation (SIC) plays a crucial role in decoding user signals sequentially. The challenge lies in the joint optimization of SIC ordering and power allocation, a task complicated by the factorial nature of ordering combinations. This study introduces an innovative solution, the Attention-based SIC Ordering and Power Allocation (ASOPA) framework, targeting an uplink NOMA network with dynamic SIC ordering. ASOPA aims to maximize weighted proportional fairness by employing deep reinforcement learning, strategically decomposing the problem into two manageable subproblems: SIC ordering optimization and optimal power allocation. We use an attention-based neural network to process real-time channel gains and user weights, determining the SIC decoding order for each user. A baseline network, serving as a mimic model, aids in the reinforcement learning process. Once the SIC ordering is established, the power allocation subproblem transforms into a convex optimization problem, enabling efficient calculation of optimal transmit power for all users. Extensive simulations validate ASOPA’s efficacy, demonstrating a performance closely paralleling the exhaustive method, with over 97% confidence in normalized network utility. Compared to the current state-of-the-art implementation, i.e., Tabu search, ASOPA achieves over 97.5% network utility of Tabu search. Furthermore, ASOPA has two orders of magnitude less execution latency than Tabu search when \n<inline-formula><tex-math>$N=10$</tex-math></inline-formula>\n and even three orders magnitude less execution latency less than Tabu search when \n<inline-formula><tex-math>$N=20$</tex-math></inline-formula>\n . Notably, ASOPA maintains a low execution latency of approximately 50 milliseconds in a ten-user NOMA network, aligning with static SIC ordering algorithms. Furthermore, ASOPA demonstrates superior performance over baseline algorithms besides Tabu search in various NOMA network configurations, including scenarios with imperfect channel state information, multiple base stations, and multiple-antenna setups. These results underscore the robustness and effectiveness of ASOPA, demonstrating its ability to ability to achieve good performance across various NOMA network environments.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 2","pages":"939-955"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Attention-Based SIC Ordering and Power Allocation for Non-Orthogonal Multiple Access Networks\",\"authors\":\"Liang Huang;Bincheng Zhu;Runkai Nan;Kaikai Chi;Yuan Wu\",\"doi\":\"10.1109/TMC.2024.3470828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-orthogonal multiple access (NOMA) emerges as a superior technology for enhancing spectral efficiency, reducing latency, and improving connectivity compared to orthogonal multiple access. In NOMA networks, successive interference cancellation (SIC) plays a crucial role in decoding user signals sequentially. The challenge lies in the joint optimization of SIC ordering and power allocation, a task complicated by the factorial nature of ordering combinations. This study introduces an innovative solution, the Attention-based SIC Ordering and Power Allocation (ASOPA) framework, targeting an uplink NOMA network with dynamic SIC ordering. ASOPA aims to maximize weighted proportional fairness by employing deep reinforcement learning, strategically decomposing the problem into two manageable subproblems: SIC ordering optimization and optimal power allocation. We use an attention-based neural network to process real-time channel gains and user weights, determining the SIC decoding order for each user. A baseline network, serving as a mimic model, aids in the reinforcement learning process. Once the SIC ordering is established, the power allocation subproblem transforms into a convex optimization problem, enabling efficient calculation of optimal transmit power for all users. Extensive simulations validate ASOPA’s efficacy, demonstrating a performance closely paralleling the exhaustive method, with over 97% confidence in normalized network utility. Compared to the current state-of-the-art implementation, i.e., Tabu search, ASOPA achieves over 97.5% network utility of Tabu search. Furthermore, ASOPA has two orders of magnitude less execution latency than Tabu search when \\n<inline-formula><tex-math>$N=10$</tex-math></inline-formula>\\n and even three orders magnitude less execution latency less than Tabu search when \\n<inline-formula><tex-math>$N=20$</tex-math></inline-formula>\\n . Notably, ASOPA maintains a low execution latency of approximately 50 milliseconds in a ten-user NOMA network, aligning with static SIC ordering algorithms. Furthermore, ASOPA demonstrates superior performance over baseline algorithms besides Tabu search in various NOMA network configurations, including scenarios with imperfect channel state information, multiple base stations, and multiple-antenna setups. These results underscore the robustness and effectiveness of ASOPA, demonstrating its ability to ability to achieve good performance across various NOMA network environments.\",\"PeriodicalId\":50389,\"journal\":{\"name\":\"IEEE Transactions on Mobile Computing\",\"volume\":\"24 2\",\"pages\":\"939-955\"},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2024-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10700682/\",\"RegionNum\":2,\"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":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10700682/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

与正交多址相比,非正交多址(NOMA)在提高频谱效率、减少延迟和改善连接性方面成为一种优越的技术。在NOMA网络中,连续干扰抵消(SIC)在用户信号的顺序解码中起着至关重要的作用。挑战在于SIC排序和功率分配的联合优化,这一任务由于排序组合的阶乘性质而变得复杂。针对具有动态SIC排序的上行NOMA网络,提出了一种创新的解决方案——基于注意力的SIC排序和功率分配(ASOPA)框架。ASOPA旨在通过采用深度强化学习,将问题战略性地分解为两个可管理的子问题:SIC排序优化和最优功率分配,从而最大化加权比例公平性。我们使用基于注意力的神经网络来处理实时信道增益和用户权重,确定每个用户的SIC解码顺序。基线网络作为模拟模型,有助于强化学习过程。一旦SIC排序建立,功率分配子问题转化为凸优化问题,能够高效地计算所有用户的最优发射功率。大量的仿真验证了ASOPA的有效性,证明其性能与穷举方法非常接近,在归一化网络效用方面的可信度超过97%。与目前最先进的实现,即禁忌搜索相比,ASOPA实现了超过97.5%的禁忌搜索网络利用率。此外,当$N=10$时,ASOPA的执行延迟比禁忌搜索低两个数量级,当$N=20$时,ASOPA的执行延迟比禁忌搜索低三个数量级。值得注意的是,ASOPA在10用户NOMA网络中保持了大约50毫秒的低执行延迟,与静态SIC排序算法保持一致。此外,ASOPA在各种NOMA网络配置(包括不完善的信道状态信息、多个基站和多天线设置)中,除了禁忌搜索之外,还展示了优于基线算法的性能。这些结果强调了ASOPA的鲁棒性和有效性,证明了它能够在各种NOMA网络环境中实现良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Attention-Based SIC Ordering and Power Allocation for Non-Orthogonal Multiple Access Networks
Non-orthogonal multiple access (NOMA) emerges as a superior technology for enhancing spectral efficiency, reducing latency, and improving connectivity compared to orthogonal multiple access. In NOMA networks, successive interference cancellation (SIC) plays a crucial role in decoding user signals sequentially. The challenge lies in the joint optimization of SIC ordering and power allocation, a task complicated by the factorial nature of ordering combinations. This study introduces an innovative solution, the Attention-based SIC Ordering and Power Allocation (ASOPA) framework, targeting an uplink NOMA network with dynamic SIC ordering. ASOPA aims to maximize weighted proportional fairness by employing deep reinforcement learning, strategically decomposing the problem into two manageable subproblems: SIC ordering optimization and optimal power allocation. We use an attention-based neural network to process real-time channel gains and user weights, determining the SIC decoding order for each user. A baseline network, serving as a mimic model, aids in the reinforcement learning process. Once the SIC ordering is established, the power allocation subproblem transforms into a convex optimization problem, enabling efficient calculation of optimal transmit power for all users. Extensive simulations validate ASOPA’s efficacy, demonstrating a performance closely paralleling the exhaustive method, with over 97% confidence in normalized network utility. Compared to the current state-of-the-art implementation, i.e., Tabu search, ASOPA achieves over 97.5% network utility of Tabu search. Furthermore, ASOPA has two orders of magnitude less execution latency than Tabu search when $N=10$ and even three orders magnitude less execution latency less than Tabu search when $N=20$ . Notably, ASOPA maintains a low execution latency of approximately 50 milliseconds in a ten-user NOMA network, aligning with static SIC ordering algorithms. Furthermore, ASOPA demonstrates superior performance over baseline algorithms besides Tabu search in various NOMA network configurations, including scenarios with imperfect channel state information, multiple base stations, and multiple-antenna setups. These results underscore the robustness and effectiveness of ASOPA, demonstrating its ability to ability to achieve good performance across various NOMA network environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
期刊最新文献
Harmonizing Global and Local Class Imbalance for Federated Learning O-RAN-Enabled Intelligent Network Slicing to Meet Service-Level Agreement (SLA) CV-Cast: Computer Vision–Oriented Linear Coding and Transmission AdaWiFi, Collaborative WiFi Sensing for Cross-Environment Adaptation BIT-FL: Blockchain-Enabled Incentivized and Secure Federated Learning Framework
×
引用
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