Joint User Association and Resource Optimization for Multi-Cell NOMA Networks

Dacai Wei, Fei Du, Jiayan Liu, Xiongwen Zhao
{"title":"Joint User Association and Resource Optimization for Multi-Cell NOMA Networks","authors":"Dacai Wei, Fei Du, Jiayan Liu, Xiongwen Zhao","doi":"10.1109/EEI59236.2023.10212880","DOIUrl":null,"url":null,"abstract":"In multi-cell networks, resource management becomes exceedingly complex as network density rises. Therefore, it is necessary to devise effective and low-complexity algorithms for resource management in multi-cell networks. This paper investigated the joint optimization problem of user association and resource optimization to improve the sum rate in multi-cell non-orthogonal multiple access (NOMA) networks. The problem is decomposed into three sub-problems. To address the coupling problem between user association and channel allocation, an iterative based method is employed. Firstly, the user association problem is addressed by proposed sum rate maximization matching (SRMM) algorithm. Then, the channel allocation problem is resolved by developed hypergraph coloring (HC) algorithm. After achieving convergence by iteratively solving the coupling problems, the power allocation problem is converted into an easily solved convex problem. Numerical results clarify that the proposed algorithm presents superior performance compared to both orthogonal multiple access (OMA) algorithm and signal-to-interference-plus-noise ratio maximization user association (SINRM-VA) algorithm.","PeriodicalId":363603,"journal":{"name":"2023 5th International Conference on Electronic Engineering and Informatics (EEI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 5th International Conference on Electronic Engineering and Informatics (EEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEI59236.2023.10212880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In multi-cell networks, resource management becomes exceedingly complex as network density rises. Therefore, it is necessary to devise effective and low-complexity algorithms for resource management in multi-cell networks. This paper investigated the joint optimization problem of user association and resource optimization to improve the sum rate in multi-cell non-orthogonal multiple access (NOMA) networks. The problem is decomposed into three sub-problems. To address the coupling problem between user association and channel allocation, an iterative based method is employed. Firstly, the user association problem is addressed by proposed sum rate maximization matching (SRMM) algorithm. Then, the channel allocation problem is resolved by developed hypergraph coloring (HC) algorithm. After achieving convergence by iteratively solving the coupling problems, the power allocation problem is converted into an easily solved convex problem. Numerical results clarify that the proposed algorithm presents superior performance compared to both orthogonal multiple access (OMA) algorithm and signal-to-interference-plus-noise ratio maximization user association (SINRM-VA) algorithm.
多小区NOMA网络的联合用户关联与资源优化
在多小区网络中,随着网络密度的增加,资源管理变得异常复杂。因此,有必要设计有效且低复杂度的多小区网络资源管理算法。为了提高多小区非正交多址(NOMA)网络的和速率,研究了用户关联和资源优化的联合优化问题。该问题被分解为三个子问题。为了解决用户关联和信道分配之间的耦合问题,采用了一种基于迭代的方法。首先,利用提出的和速率最大化匹配算法解决用户关联问题。然后,利用超图着色(HC)算法解决了信道分配问题。通过迭代求解耦合问题达到收敛后,将功率分配问题转化为一个易解的凸问题。数值结果表明,与正交多址(OMA)算法和信噪比最大化用户关联(SINRM-VA)算法相比,该算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信