基于SCMA的多业务网络切片资源分配

Yong Zhang, Zhenyu Zhang, Di Wu, Jie Bao
{"title":"基于SCMA的多业务网络切片资源分配","authors":"Yong Zhang, Zhenyu Zhang, Di Wu, Jie Bao","doi":"10.1109/ICECE54449.2021.9674394","DOIUrl":null,"url":null,"abstract":"Sparse code multiple access (SCMA) is a non-orthogonal multiple-access technique, and how to apply it to enhanced mobile broadband (eMBB) and ultrareliable low latency communication (URLLC) coexisting multiservice network slices is a serious challenge. The correlation among subcarriers, codebooks, users and power allocation are all issues that need to be solved by this system. Thus, we propose a SCMA-based slicing model for multi-service networks, and design a heuristic greedy algorithm and a power allocation algorithm based on Karush-Kuhn-Tucker conditions (KKT). The former obtains a sub-optimal solution of the problem by assigning codebooks to users and performing subcarrier matching, and the latter obtains the optimal solution of power allocation by the KKT condition. The simulation results demonstrate the feasibility of the algorithm and show that the SCMA scheme can achieve higher energy efficiency compared with the Orthogonal Multiple Access (OMA) scheme.","PeriodicalId":166178,"journal":{"name":"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource allocation of Multi-service Network Slicing based on SCMA\",\"authors\":\"Yong Zhang, Zhenyu Zhang, Di Wu, Jie Bao\",\"doi\":\"10.1109/ICECE54449.2021.9674394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sparse code multiple access (SCMA) is a non-orthogonal multiple-access technique, and how to apply it to enhanced mobile broadband (eMBB) and ultrareliable low latency communication (URLLC) coexisting multiservice network slices is a serious challenge. The correlation among subcarriers, codebooks, users and power allocation are all issues that need to be solved by this system. Thus, we propose a SCMA-based slicing model for multi-service networks, and design a heuristic greedy algorithm and a power allocation algorithm based on Karush-Kuhn-Tucker conditions (KKT). The former obtains a sub-optimal solution of the problem by assigning codebooks to users and performing subcarrier matching, and the latter obtains the optimal solution of power allocation by the KKT condition. The simulation results demonstrate the feasibility of the algorithm and show that the SCMA scheme can achieve higher energy efficiency compared with the Orthogonal Multiple Access (OMA) scheme.\",\"PeriodicalId\":166178,\"journal\":{\"name\":\"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECE54449.2021.9674394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECE54449.2021.9674394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

稀疏码多址(SCMA)是一种非正交多址技术,如何将其应用于增强型移动宽带(eMBB)和超可靠低延迟通信(URLLC)共存的多业务网络切片是一个严峻的挑战。子载波间、码本间、用户间的相互关系、功率分配等都是该系统需要解决的问题。因此,我们提出了一种基于scma的多业务网络切片模型,并设计了一种启发式贪婪算法和一种基于Karush-Kuhn-Tucker条件(KKT)的功率分配算法。前者通过给用户分配码本并进行子载波匹配得到问题的次优解,后者通过KKT条件得到功率分配的最优解。仿真结果验证了该算法的可行性,并表明与正交多址(OMA)方案相比,SCMA方案具有更高的能效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource allocation of Multi-service Network Slicing based on SCMA
Sparse code multiple access (SCMA) is a non-orthogonal multiple-access technique, and how to apply it to enhanced mobile broadband (eMBB) and ultrareliable low latency communication (URLLC) coexisting multiservice network slices is a serious challenge. The correlation among subcarriers, codebooks, users and power allocation are all issues that need to be solved by this system. Thus, we propose a SCMA-based slicing model for multi-service networks, and design a heuristic greedy algorithm and a power allocation algorithm based on Karush-Kuhn-Tucker conditions (KKT). The former obtains a sub-optimal solution of the problem by assigning codebooks to users and performing subcarrier matching, and the latter obtains the optimal solution of power allocation by the KKT condition. The simulation results demonstrate the feasibility of the algorithm and show that the SCMA scheme can achieve higher energy efficiency compared with the Orthogonal Multiple Access (OMA) scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design of Emergency Rescue Command Platform Based on Satellite Mobile Communication System Multi-Dimensional Spectrum Data Denoising Based on Tensor Theory Predicting COVID-19 Severe Patients and Evaluation Method of 3 Stages Severe Level by Machine Learning A Novel Stacking Framework Based On Hybrid of Gradient Boosting-Adaptive Boosting-Multilayer Perceptron for Crash Injury Severity Prediction and Analysis Key Techniques on Unified Identity Authentication in OpenMBEE Integration
×
引用
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