Smart NOMA-HARQ for Short Packet Communications

Saleheh Poursheikhali, Fatemeh Ghanami
{"title":"Smart NOMA-HARQ for Short Packet Communications","authors":"Saleheh Poursheikhali, Fatemeh Ghanami","doi":"10.1109/IWCIT57101.2022.10206884","DOIUrl":null,"url":null,"abstract":"In this paper, we address the smart NOMA-HARQ with a one-allowed re-transmission scheme in a two-user uplink scenario to improve users’ fairness. Each user is allowed to re-transmit once provided that its previous packet was not successfully decoded and the BS performs in a smart way during transmission. In the proposed scheme, NOMA-HARQ offers a chance to decrease the number of re-transmissions, and the system throughput is improved compared to conventional NOMAHARQ. Furthermore, the fairness between users increases due to the remarkable reduction in the required number of retransmissions of the far user. In our model, the users’ power allocation is performed via an optimization problem in that the packet error rate is minimized under power constraints. To analyze the system’s dynamics, a Markov model is first proposed. Then, the power splitting ratios are obtained based on the optimization problem results. The simulation results verify that smart NOMA-HARQ outperforms conventional NOMA-HARQ in terms of the PER, fairness, and throughput under the same rate and total received power at the BS.","PeriodicalId":446341,"journal":{"name":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 10th Iran Workshop on Communication and Information Theory (IWCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCIT57101.2022.10206884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we address the smart NOMA-HARQ with a one-allowed re-transmission scheme in a two-user uplink scenario to improve users’ fairness. Each user is allowed to re-transmit once provided that its previous packet was not successfully decoded and the BS performs in a smart way during transmission. In the proposed scheme, NOMA-HARQ offers a chance to decrease the number of re-transmissions, and the system throughput is improved compared to conventional NOMAHARQ. Furthermore, the fairness between users increases due to the remarkable reduction in the required number of retransmissions of the far user. In our model, the users’ power allocation is performed via an optimization problem in that the packet error rate is minimized under power constraints. To analyze the system’s dynamics, a Markov model is first proposed. Then, the power splitting ratios are obtained based on the optimization problem results. The simulation results verify that smart NOMA-HARQ outperforms conventional NOMA-HARQ in terms of the PER, fairness, and throughput under the same rate and total received power at the BS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
短分组通信的智能NOMA-HARQ
为了提高用户公平性,在双用户上行场景下,提出了一种允许重传的智能NOMA-HARQ方案。如果每个用户之前的数据包没有被成功解码,并且BS在传输过程中以智能方式执行,则允许每个用户重新传输一次。在提出的方案中,NOMA-HARQ提供了减少重传次数的机会,与传统的NOMAHARQ相比,系统吞吐量得到了提高。此外,由于远端用户所需的重传次数显著减少,用户之间的公平性得到了提高。在我们的模型中,用户的功率分配是通过在功率约束下最小化数据包错误率的优化问题来完成的。为了分析系统的动力学,首先提出了一个马尔可夫模型。然后,根据优化问题的结果得到功率分割比。仿真结果表明,在相同速率和接收总功率下,智能NOMA-HARQ在PER、公平性和吞吐量方面都优于传统NOMA-HARQ。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Smart NOMA-HARQ for Short Packet Communications A Jamming Resistant Molecular Communication Scheme Copula-based Analysis of Interference Channels: Outage Probability New table of Bounds on Permutation Codes under Kendall τ-Metric Entropic Weighted Rank Function
×
引用
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