Resource scheduling in non-orthogonal multiple access (NOMA) based cloud-RAN systems

R. Rai, Huiling Zhu, Jiangzhou Wang
{"title":"Resource scheduling in non-orthogonal multiple access (NOMA) based cloud-RAN systems","authors":"R. Rai, Huiling Zhu, Jiangzhou Wang","doi":"10.1109/UEMCON.2017.8249102","DOIUrl":null,"url":null,"abstract":"Cloud radio access network (C-RAN) is enabling innovation which can address a number of challenges that cellular network operators (CNOs) face while trying to support ever growing end users' needs towards 5th generation (5G) of mobile networks. This paper investigates a scheduling problem to enhance the performance of non-orthogonal multiple access (NOMA) based cloud radio access networks (C-RAN). We consider the downlink of a C-RAN where cloud is responsible for the scheduling policy and formulate the scheduling problem. In this paper non-orthogonal multiple access (NOMA) is adopted and resource scheduling techniques in an unconstrained C-RAN networks are proposed. We design an efficient resource scheduling algorithm to assist the resource scheduling process in NOMA based C-RAN systems. We formulate the problem as binary integer programming (BIP) optimization problem and propose a suboptimal BIP algorithm and a greedy heuristic allocation algorithm which leads to the maximization of throughput in terms of sum rate when compared with the standard techniques. Simulation results shows significant performance improvement with the proposed algorithms.","PeriodicalId":403890,"journal":{"name":"2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UEMCON.2017.8249102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Cloud radio access network (C-RAN) is enabling innovation which can address a number of challenges that cellular network operators (CNOs) face while trying to support ever growing end users' needs towards 5th generation (5G) of mobile networks. This paper investigates a scheduling problem to enhance the performance of non-orthogonal multiple access (NOMA) based cloud radio access networks (C-RAN). We consider the downlink of a C-RAN where cloud is responsible for the scheduling policy and formulate the scheduling problem. In this paper non-orthogonal multiple access (NOMA) is adopted and resource scheduling techniques in an unconstrained C-RAN networks are proposed. We design an efficient resource scheduling algorithm to assist the resource scheduling process in NOMA based C-RAN systems. We formulate the problem as binary integer programming (BIP) optimization problem and propose a suboptimal BIP algorithm and a greedy heuristic allocation algorithm which leads to the maximization of throughput in terms of sum rate when compared with the standard techniques. Simulation results shows significant performance improvement with the proposed algorithms.
基于非正交多址(NOMA)的云- ran系统中的资源调度
云无线接入网(C-RAN)正在实现创新,可以解决蜂窝网络运营商(CNOs)在努力支持不断增长的终端用户对第五代(5G)移动网络需求的同时面临的许多挑战。研究了提高非正交多址(NOMA)云无线接入网(C-RAN)性能的调度问题。我们考虑C-RAN的下行链路,其中云负责调度策略,并制定调度问题。本文采用非正交多址(NOMA)技术,提出了无约束C-RAN网络中的资源调度技术。设计了一种高效的资源调度算法来辅助基于NOMA的C-RAN系统的资源调度过程。我们将该问题表述为二进制整数规划(BIP)优化问题,并提出了次优BIP算法和贪婪启发式分配算法,与标准技术相比,该算法在求和速率方面使吞吐量最大化。仿真结果表明,该算法的性能得到了显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信