Radio resource allocation for uplink sparse code multiple access (SCMA) networks using matching game | |
Di, Boya ; Song, Lingyang ; Li, Yonghui | |
2016 | |
英文摘要 | In this paper, we study the codebook-based resource allocation problem for an uplink sparse code multiple access (SCMA) network. The base station (BS) assigns to each user a set of subcarriers corresponding to a specific codebook, and each user performs power control over multiple subcarriers. We aim to optimize the subcarrier assignment and power allocation to maximize the total sum-rate. To solve the above problem, we formulate it as a many-to-many two-sided matching problem with externalities. A novel swap-matching algorithm is then proposed in which the users and the subcarriers are considered as two sets of players, and every two users can cooperate to swap their matches so as to improve each other's profits. The algorithm converges to a pair-wise stable matching after a limited number of iterations. Simulation results show that the proposed algorithm greatly outperforms the orthogonal multiple access scheme and a random allocation scheme. ? 2016 IEEE.; EI |
语种 | 英语 |
出处 | 2016 IEEE International Conference on Communications, ICC 2016 |
DOI标识 | 10.1109/ICC.2016.7511409 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/449274] ![]() |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Di, Boya,Song, Lingyang,Li, Yonghui. Radio resource allocation for uplink sparse code multiple access (SCMA) networks using matching game. 2016-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论