Downlink resource allocation for NOMA-based hybrid spectrum access in cognitive network

IF 3.1 3区 计算机科学 Q2 TELECOMMUNICATIONS China Communications Pub Date : 2023-09-01 DOI:10.23919/JCC.ea.2021-0156.202302
Yong Zhang, Zhenjie Cheng, Da Guo, Siyu Yuan, Tengteng Ma, Zhenyu Zhang
{"title":"Downlink resource allocation for NOMA-based hybrid spectrum access in cognitive network","authors":"Yong Zhang, Zhenjie Cheng, Da Guo, Siyu Yuan, Tengteng Ma, Zhenyu Zhang","doi":"10.23919/JCC.ea.2021-0156.202302","DOIUrl":null,"url":null,"abstract":"To solve the contradiction between limited spectrum resources and increasing communication demand, this paper proposes a wireless resource allocation scheme based on the Deep Q Network (DQN) to allocate radio resources in a downlink multi-user cognitive radio (CR) network with slicing. Secondary users (SUs) are multiplexed using non-orthogonal multiple access (NOMA). The SUs use the hybrid spectrum access mode to improve the spectral efficiency (SE). Considering the demand for multiple services, the enhanced mobile broadband (eMBB) slice and ultrareliable low-latency communication (URLLC) slice were established. The proposed scheme can maximize the SE while ensuring Quality of Service (QoS) for the users. This study established a mapping relationship between resource allocation and the DQN algorithm in the CR-NOMA network. According to the signal-to-interference-plus-noise ratio (SINR) of the primary users (PUs), the proposed scheme can output the optimal channel selection and power allocation. The simulation results reveal that the proposed scheme can converge faster and obtain higher rewards compared with the Q-Learning scheme. Additionally, the proposed scheme has better SE than both the overlay and underlay only modes.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":3.1000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"China Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.23919/JCC.ea.2021-0156.202302","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

To solve the contradiction between limited spectrum resources and increasing communication demand, this paper proposes a wireless resource allocation scheme based on the Deep Q Network (DQN) to allocate radio resources in a downlink multi-user cognitive radio (CR) network with slicing. Secondary users (SUs) are multiplexed using non-orthogonal multiple access (NOMA). The SUs use the hybrid spectrum access mode to improve the spectral efficiency (SE). Considering the demand for multiple services, the enhanced mobile broadband (eMBB) slice and ultrareliable low-latency communication (URLLC) slice were established. The proposed scheme can maximize the SE while ensuring Quality of Service (QoS) for the users. This study established a mapping relationship between resource allocation and the DQN algorithm in the CR-NOMA network. According to the signal-to-interference-plus-noise ratio (SINR) of the primary users (PUs), the proposed scheme can output the optimal channel selection and power allocation. The simulation results reveal that the proposed scheme can converge faster and obtain higher rewards compared with the Q-Learning scheme. Additionally, the proposed scheme has better SE than both the overlay and underlay only modes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
认知网络中基于noma的混合频谱接入下行资源分配
为了解决有限的频谱资源与不断增长的通信需求之间的矛盾,提出了一种基于深度Q网络(Deep Q Network, DQN)的无线资源分配方案,对下行多用户认知无线电(CR)网络中的无线资源进行切片分配。辅助用户(su)使用非正交多址(NOMA)进行多路复用。单元采用混合频谱接入方式提高频谱效率(SE)。考虑到多种业务的需求,建立了增强型移动宽带(eMBB)切片和超可靠低延迟通信(URLLC)切片。该方案在保证用户服务质量(QoS)的同时,能最大限度地提高SE。本研究建立了CR-NOMA网络中资源分配与DQN算法之间的映射关系。该方案根据主用户(pu)的信噪比(SINR),输出最优的信道选择和功率分配。仿真结果表明,与Q-Learning方案相比,该方案具有更快的收敛速度和更高的奖励。此外,该方案比覆盖模式和仅覆盖模式都具有更好的SE。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
China Communications
China Communications 工程技术-电信学
CiteScore
8.00
自引率
12.20%
发文量
2868
审稿时长
8.6 months
期刊介绍: China Communications (ISSN 1673-5447) is an English-language monthly journal cosponsored by the China Institute of Communications (CIC) and IEEE Communications Society (IEEE ComSoc). It is aimed at readers in industry, universities, research and development organizations, and government agencies in the field of Information and Communications Technologies (ICTs) worldwide. The journal's main objective is to promote academic exchange in the ICTs sector and publish high-quality papers to contribute to the global ICTs industry. It provides instant access to the latest articles and papers, presenting leading-edge research achievements, tutorial overviews, and descriptions of significant practical applications of technology. China Communications has been indexed in SCIE (Science Citation Index-Expanded) since January 2007. Additionally, all articles have been available in the IEEE Xplore digital library since January 2013.
期刊最新文献
Broadband dual-input doherty power amplifier design based on a simple adaptive power dividing ratio function MTCR-CR routing strategy for connection-oriented routing over satellite networks Resource allocation in multi-user cellular networks: A transformer-based deep reinforcement learning approach Improved PSO-extreme learning machine algorithm for indoor localization A practical approach for missing wireless sensor networks data recovery
×
引用
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