DNN-based algorithm for joint SIC ordering and power allocation in downlink NOMA-enabled heterogeneous networks

IF 4.2 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS ICT Express Pub Date : 2024-12-01 DOI:10.1016/j.icte.2024.06.004
Donghyeon Kim , Jung-Bin Kim , Haejoon Jung , In-Ho Lee
{"title":"DNN-based algorithm for joint SIC ordering and power allocation in downlink NOMA-enabled heterogeneous networks","authors":"Donghyeon Kim ,&nbsp;Jung-Bin Kim ,&nbsp;Haejoon Jung ,&nbsp;In-Ho Lee","doi":"10.1016/j.icte.2024.06.004","DOIUrl":null,"url":null,"abstract":"<div><div>In the heterogeneous network (HetNet) employing downlink non-orthogonal multiple access (NOMA), we focus on the non-convex optimization problem to optimize the spectral efficiency (SE) while the users satisfy the quality-of-service (QoS) requirement. In the previous work, the optimal joint successive interference cancellation and power allocation (JSPA) algorithm for maximizing SE is proposed to solve the mixed-integer non-linear programming (MINLP) problem in NOMA-enabled HetNet. However, the optimal solution requires exponential complexity by the number of base stations (BSs). Therefore, we present a deep neural network (DNN)-based algorithm for JSPA to reduce the complexity. In particular, to deal with the MINLP-based JSPA problem, we reformulate it into an equivalently simple problem that optimizes only the power consumption of BSs. Then, we introduce the unsupervised DNN-based method for JSPA to handle the simplified problem. The presented scheme yields improved SE and outage performance compared with traditional DNN-based methods. Additionally, we propose a user selection scheme with low complexity to enhance the SE of the proposed DNN-based power allocation. Through simulations, we illustrate that the suggested DNN-based scheme can attain SE performance similar to that of the optimal scheme.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1301-1307"},"PeriodicalIF":4.2000,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICT Express","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2405959524000754","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In the heterogeneous network (HetNet) employing downlink non-orthogonal multiple access (NOMA), we focus on the non-convex optimization problem to optimize the spectral efficiency (SE) while the users satisfy the quality-of-service (QoS) requirement. In the previous work, the optimal joint successive interference cancellation and power allocation (JSPA) algorithm for maximizing SE is proposed to solve the mixed-integer non-linear programming (MINLP) problem in NOMA-enabled HetNet. However, the optimal solution requires exponential complexity by the number of base stations (BSs). Therefore, we present a deep neural network (DNN)-based algorithm for JSPA to reduce the complexity. In particular, to deal with the MINLP-based JSPA problem, we reformulate it into an equivalently simple problem that optimizes only the power consumption of BSs. Then, we introduce the unsupervised DNN-based method for JSPA to handle the simplified problem. The presented scheme yields improved SE and outage performance compared with traditional DNN-based methods. Additionally, we propose a user selection scheme with low complexity to enhance the SE of the proposed DNN-based power allocation. Through simulations, we illustrate that the suggested DNN-based scheme can attain SE performance similar to that of the optimal scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于dnn的异构下行noma网络SIC联合排序与功率分配算法
在采用下行链路非正交多址(NOMA)的异构网络(HetNet)中,重点研究在满足用户服务质量(QoS)要求的同时,优化频谱效率(SE)的非凸优化问题。在之前的工作中,提出了最大化SE的最优联合连续干扰抵消和功率分配(JSPA)算法来解决基于noma的HetNet中的混合整数非线性规划(MINLP)问题。然而,最优解决方案要求基站(BSs)数量的指数复杂度。因此,我们提出了一种基于深度神经网络(DNN)的JSPA算法来降低复杂性。特别是,为了处理基于minlp的JSPA问题,我们将其重新表述为一个同样简单的问题,该问题仅优化BSs的功耗。然后,我们引入了基于无监督dnn的JSPA方法来处理简化问题。与传统的基于深度神经网络的方法相比,该方法提高了SE和中断性能。此外,我们还提出了一种低复杂度的用户选择方案,以提高所提出的基于dnn的功率分配的SE。通过仿真,我们证明了基于dnn的方案可以获得与最优方案相似的SE性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ICT Express
ICT Express Multiple-
CiteScore
10.20
自引率
1.90%
发文量
167
审稿时长
35 weeks
期刊介绍: The ICT Express journal published by the Korean Institute of Communications and Information Sciences (KICS) is an international, peer-reviewed research publication covering all aspects of information and communication technology. The journal aims to publish research that helps advance the theoretical and practical understanding of ICT convergence, platform technologies, communication networks, and device technologies. The technology advancement in information and communication technology (ICT) sector enables portable devices to be always connected while supporting high data rate, resulting in the recent popularity of smartphones that have a considerable impact in economic and social development.
期刊最新文献
Editorial Board Action recognition: A comprehensive survey of tasks, methods, and challenges Spatial attention and wide activation-based deep super-resolution scheme for vehicle detection in noisy and low-resolution LEO satellite imagery Toward storage-aware learning with compressed data an empirical exploratory study on JPEG A comprehensive survey on masked face recognition techniques using deep learning: Motivations, research progress, and future challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1