DNN based Adaptive User Pairing and Power Allocation to achieve α-Fairness in NOMA Systems with Imperfections in SIC

Siva Mouni Nemalidinne, Pavan Reddy Manne, Abhinav Kumar, P. K. Upadhyay
{"title":"DNN based Adaptive User Pairing and Power Allocation to achieve α-Fairness in NOMA Systems with Imperfections in SIC","authors":"Siva Mouni Nemalidinne, Pavan Reddy Manne, Abhinav Kumar, P. K. Upadhyay","doi":"10.1145/3564121.3565042","DOIUrl":null,"url":null,"abstract":"Non-orthogonal multiple access (NOMA) technology aided with successive interference cancellation (SIC) is expected to achieve multi-fold improvements in the network capacity. However, the SIC in practice is prone to imperfections and this degrades the achievable gains with NOMA. Additionally, inappropriate user pairing and power allocation in NOMA can adversely affect the fairness between paired users. Hence, the impact of imperfections in SIC and fairness should be considered for user pairing and power allocation in NOMA. Motivated by this, we formulate the user pairing and power allocation to achieve α-fairness among the paired users as an optimization problem. To obtain a feasible solution in practice, we then propose a two-step machine learning-based approach to solve the problem. We use a random forest classifier (RFC) to establish a pairing criterion and a deep neural network (DNN) to allocate the power factors to the NOMA pair. The performance of the proposed supervised learning (SL) models is extensively evaluated and compared with other pre-existing algorithms. We analyze the performance of DNN for varying number of neurons in the hidden layer by considering different activation functions. We show that with 4 neurons in the hidden layer and sigmoid activation function, the trained DNN network outperforms the existing SL algorithms. We then use the trained network and perform Monte-Carlo simulations to quantify the achievable gains. We show that the proposed approach achieves an excellent solution that maximizes fairness and also ensures minimum required data rates for each user. Through extensive numerical evaluations, we show that our proposed two-step machine learning approach outperforms various state-of-the-art algorithms.","PeriodicalId":166150,"journal":{"name":"Proceedings of the Second International Conference on AI-ML Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Second International Conference on AI-ML Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3564121.3565042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Non-orthogonal multiple access (NOMA) technology aided with successive interference cancellation (SIC) is expected to achieve multi-fold improvements in the network capacity. However, the SIC in practice is prone to imperfections and this degrades the achievable gains with NOMA. Additionally, inappropriate user pairing and power allocation in NOMA can adversely affect the fairness between paired users. Hence, the impact of imperfections in SIC and fairness should be considered for user pairing and power allocation in NOMA. Motivated by this, we formulate the user pairing and power allocation to achieve α-fairness among the paired users as an optimization problem. To obtain a feasible solution in practice, we then propose a two-step machine learning-based approach to solve the problem. We use a random forest classifier (RFC) to establish a pairing criterion and a deep neural network (DNN) to allocate the power factors to the NOMA pair. The performance of the proposed supervised learning (SL) models is extensively evaluated and compared with other pre-existing algorithms. We analyze the performance of DNN for varying number of neurons in the hidden layer by considering different activation functions. We show that with 4 neurons in the hidden layer and sigmoid activation function, the trained DNN network outperforms the existing SL algorithms. We then use the trained network and perform Monte-Carlo simulations to quantify the achievable gains. We show that the proposed approach achieves an excellent solution that maximizes fairness and also ensures minimum required data rates for each user. Through extensive numerical evaluations, we show that our proposed two-step machine learning approach outperforms various state-of-the-art algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于DNN的自适应用户配对和功率分配在SIC不完善的NOMA系统中实现α-公平
借助连续干扰消除(SIC)的非正交多址(NOMA)技术有望实现网络容量的多倍提升。然而,SIC在实践中容易出现缺陷,这降低了NOMA可实现的增益。此外,在NOMA中,不适当的用户配对和权力分配会对配对用户之间的公平性产生不利影响。因此,在NOMA的用户配对和功率分配中,需要考虑SIC缺陷和公平性的影响。基于此,我们将用户配对和功率分配作为优化问题来实现配对用户之间的α-公平。为了在实践中获得可行的解决方案,我们提出了一种基于机器学习的两步方法来解决问题。我们使用随机森林分类器(RFC)建立配对标准,并使用深度神经网络(DNN)将功率因子分配给NOMA对。本文对所提出的监督学习(SL)模型的性能进行了广泛的评估,并与其他已有算法进行了比较。我们通过考虑不同的激活函数来分析深层神经网络在不同隐藏层神经元数量下的性能。我们证明,在隐藏层中使用4个神经元和s型激活函数,训练后的DNN网络优于现有的SL算法。然后,我们使用训练好的网络并执行蒙特卡罗模拟来量化可实现的增益。我们表明,所提出的方法实现了一个很好的解决方案,最大限度地提高了公平性,并确保了每个用户所需的最小数据速率。通过广泛的数值评估,我们表明我们提出的两步机器学习方法优于各种最先进的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Planning System for Smart Charging of Electric Fleets CluSpa: Computation Reduction in CNN Inference by exploiting Clustering and Sparsity Acceleration-aware, Retraining-free Evolutionary Pruning for Automated Fitment of Deep Learning Models on Edge Devices Patch-wise Features for Blur Image Classification Identification of Causal Dependencies in Multivariate Time Series
×
引用
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