A multi-user access scheme for throughput enhancement in UDN with NOMA

Yiming Liu, Xi Li, Hong Ji, Heli Zhang
{"title":"A multi-user access scheme for throughput enhancement in UDN with NOMA","authors":"Yiming Liu, Xi Li, Hong Ji, Heli Zhang","doi":"10.1109/ICCW.2017.7962849","DOIUrl":null,"url":null,"abstract":"Ultra Dense network (UDN) is considered as one of the promising and efficient communication solution for high throughput and large connection numbers scenarios. Due to the densification of the users perspective and massive-access opportunities, how to optimize the multiple users access in UDN is an important and complicated problem. The traditional multi-user access schemes may be no longer suitable. Thus, in this paper, we investigate the multi-user access issue with densely-deployed access points (APs) in UDN. Moreover, to further enhance the system throughput and meet the high rate demands of users, the non-orthogonal multiple access (NOMA) is introduced into UDN. Considering the network densification and newly incorporated technological features, we formulate the multi-user access and corresponding resource allocation problem as an optimization problem to enhance the system throughput. To solve it with low-computation complexity, this complex problem is divided into two sub phases, APs association and resource allocation. First, we propose a matching algorithm to assign proper APs and resource blocks (RBs) to the multiple users. According to the channel state information and data rate requirement, a stable matching among the sets of APs, users and RBs is formed after a limited number of iterations. Then, we allocate the transmit power for associated APs based on NOMA by utilizing the differ convex (DC) programming. Numerical results show that the proposed scheme achieves a better performance compared with exiting schemes.","PeriodicalId":6656,"journal":{"name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"52 1","pages":"1364-1369"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2017.7962849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Ultra Dense network (UDN) is considered as one of the promising and efficient communication solution for high throughput and large connection numbers scenarios. Due to the densification of the users perspective and massive-access opportunities, how to optimize the multiple users access in UDN is an important and complicated problem. The traditional multi-user access schemes may be no longer suitable. Thus, in this paper, we investigate the multi-user access issue with densely-deployed access points (APs) in UDN. Moreover, to further enhance the system throughput and meet the high rate demands of users, the non-orthogonal multiple access (NOMA) is introduced into UDN. Considering the network densification and newly incorporated technological features, we formulate the multi-user access and corresponding resource allocation problem as an optimization problem to enhance the system throughput. To solve it with low-computation complexity, this complex problem is divided into two sub phases, APs association and resource allocation. First, we propose a matching algorithm to assign proper APs and resource blocks (RBs) to the multiple users. According to the channel state information and data rate requirement, a stable matching among the sets of APs, users and RBs is formed after a limited number of iterations. Then, we allocate the transmit power for associated APs based on NOMA by utilizing the differ convex (DC) programming. Numerical results show that the proposed scheme achieves a better performance compared with exiting schemes.
基于NOMA的UDN多用户接入方案
超密集网络(UDN)被认为是高吞吐量和大连接数场景下最有前途的高效通信解决方案之一。由于用户视角的致密化和海量的访问机会,如何优化UDN中的多用户访问是一个重要而复杂的问题。传统的多用户接入方案可能不再适用。因此,在本文中,我们研究了UDN中密集部署接入点(ap)的多用户访问问题。此外,为了进一步提高系统吞吐量和满足用户的高速率需求,在UDN中引入了非正交多址(NOMA)技术。考虑到网络密度和新纳入的技术特点,我们将多用户接入和相应的资源分配问题作为一个优化问题来提出,以提高系统吞吐量。为了降低计算复杂度,将该复杂问题分为ap关联和资源分配两个子阶段。首先,我们提出了一种匹配算法,为多个用户分配适当的ap和资源块(RBs)。根据信道状态信息和数据速率要求,经过有限次数的迭代,ap、用户和RBs之间形成稳定的匹配。然后,利用差分凸规划(DC)对基于NOMA的关联ap分配发射功率。数值结果表明,与现有方案相比,该方案具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信