Computational Analysis of Uplink NOMA and OMA for 5G Applications: An Optimized Network

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Informatica Pub Date : 2023-06-05 DOI:10.31449/inf.v47i3.4145
Shelesh Krishna Saraswat, Vinay Kumar Deolia, Aasheesh Shukla
{"title":"Computational Analysis of Uplink NOMA and OMA for 5G Applications: An Optimized Network","authors":"Shelesh Krishna Saraswat, Vinay Kumar Deolia, Aasheesh Shukla","doi":"10.31449/inf.v47i3.4145","DOIUrl":null,"url":null,"abstract":"In This paper, the non-orthogonal multiple access (NOMA) schemes are compared with the multiple orthogonal access (OMA) schemes on the basis of the resource allocation validity of uplinks. By reflecting the involvement of a measure of each user’s data on the system’s total amount, we analyze the main reasons why NOMA provides justice service distribution over OMA on unequal channels. Moreover, the Jain index is observed and proposed to quantify the irregularity of numerous user channels, according to the metric for the Jain index based on the Jain index. More importantly, the proposed metric establishes the criteria for choosing between NOMA and OMA to share resources correctly. Based on this debate, we offer a program that combines NOMA and OMA to increase user integrity. Imitation effects substantiate the exactness of the proposed matrix and display improvement of the accuracy of the showcased NOMA-OMA mixture system as compared to standard OMA as well as NOMA systems.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"19 1","pages":"0"},"PeriodicalIF":3.3000,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31449/inf.v47i3.4145","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In This paper, the non-orthogonal multiple access (NOMA) schemes are compared with the multiple orthogonal access (OMA) schemes on the basis of the resource allocation validity of uplinks. By reflecting the involvement of a measure of each user’s data on the system’s total amount, we analyze the main reasons why NOMA provides justice service distribution over OMA on unequal channels. Moreover, the Jain index is observed and proposed to quantify the irregularity of numerous user channels, according to the metric for the Jain index based on the Jain index. More importantly, the proposed metric establishes the criteria for choosing between NOMA and OMA to share resources correctly. Based on this debate, we offer a program that combines NOMA and OMA to increase user integrity. Imitation effects substantiate the exactness of the proposed matrix and display improvement of the accuracy of the showcased NOMA-OMA mixture system as compared to standard OMA as well as NOMA systems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向5G应用的上行NOMA和OMA计算分析:一个优化的网络
本文在上行链路资源分配有效性的基础上,对非正交多址(NOMA)方案与多正交多址(OMA)方案进行了比较。通过反映每个用户数据对系统总量的影响,我们分析了NOMA在不平等渠道上提供司法服务分配的主要原因。此外,根据基于Jain指数的Jain指数度量,观察并提出了Jain指数来量化众多用户通道的不规则性。更重要的是,所建议的度量建立了在NOMA和OMA之间进行选择以正确共享资源的标准。基于这一争论,我们提供了一个将NOMA和OMA结合起来的程序,以提高用户的完整性。与标准的OMA和NOMA系统相比,仿真效果证实了所提出矩阵的准确性,并显示了所展示的NOMA-OMA混合系统的准确性的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Informatica
Informatica 工程技术-计算机:信息系统
CiteScore
5.90
自引率
6.90%
发文量
19
审稿时长
12 months
期刊介绍: The quarterly journal Informatica provides an international forum for high-quality original research and publishes papers on mathematical simulation and optimization, recognition and control, programming theory and systems, automation systems and elements. Informatica provides a multidisciplinary forum for scientists and engineers involved in research and design including experts who implement and manage information systems applications.
期刊最新文献
Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems Confidential Transaction Balance Verification by the Net Using Non-Interactive Zero-Knowledge Proofs An Improved Algorithm for Extracting Frequent Gradual Patterns Offloaded Data Processing Energy Efficiency Evaluation Demystifying the Stability and the Performance Aspects of CoCoSo Ranking Method under Uncertain Preferences
×
引用
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