Radio resource allocation for non-orthogonal multiple access (NOMA) relay network using matching game | |
Zhang, Shuhang ; Di, Boya ; Song, Lingyang ; Li, Yonghui | |
2016 | |
英文摘要 | In this paper, we study the resource allocation problem for a single-cell non-orthogonal multiple access (NOMA) relay network where an OFDM amplify-and-forward (AF) relay allocates the spectrum and power resources to the source-destination (SD) pairs. We aim to optimize the spectrum and power resource allocation to maximize the total sum-rate. This is a very complicated problem and the optimal approach requires an exhaustive search, leading to a NP hard problem. To solve this problem, we propose an efficient many-to-many two sided SD pair-subchannel matching algorithm in which the SD pairs and sub-channels are considered as two sets of rational and selfish players chasing their own interests. The algorithm converges to a pair-wise stable matching after a limited number of iterations with a low complexity compared with the optimal solution. Simulation results show that the sum-rate of the proposed algorithm approaches the performance of the optimal exhaustive search and significantly outperforms the conventional orthogonal multiple access scheme, in terms of the total sum-rate and number of accessed SD pairs. ? 2016 IEEE.; EI |
语种 | 英语 |
出处 | 2016 IEEE International Conference on Communications, ICC 2016 |
DOI标识 | 10.1109/ICC.2016.7510918 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/449249] |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Zhang, Shuhang,Di, Boya,Song, Lingyang,et al. Radio resource allocation for non-orthogonal multiple access (NOMA) relay network using matching game. 2016-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论