文献类型：期刊文献

英文题名：Licensed and Unlicensed Bands Allocation for Cellular Users: A Matching-Based Approach

作者：Gao, Yuan[1];Wu, Yue[2];Hu, Haonan[3];Chu, Xiaoli[1];Zhang, Jie[1]

机构：[1]Univ Sheffield, Dept Elect & Elect Engn, Sheffield S1 4ET, S Yorkshire, England;[2]East China Univ Sci & Technol, Sch Informat Sci & Engn, Shanghai 200237, Peoples R China;[3]Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China

年份：2019

卷号：8

期号：3

起止页码：969

外文期刊名：IEEE WIRELESS COMMUNICATIONS LETTERS

收录：;EI(收录号：20192607096873);WOS:【SCI-EXPANDED(收录号:WOS:000472579800080)】；

基金：This work was supported in part by the European Union's Horizon 2020 Research and Innovation Programme under Grant 645705, and in part by the Shanghai Sailing Program under Grant 18YF1405300. The associate editor coordinating the review of this paper and approving it for publication was Y. Gao. (Corresponding author: Haonan Hu.)

语种：英文

外文关键词：LTE-unlicensed; multi-objective optimization; one-to-one matching; many-to-one matching

摘要：Long term evolution-unlicensed (LTE-U) technologies allow cellular users (CUs) to be served in unlicensed bands. However, how a CU properly chooses between licensed and unlicensed bands and how a CU can utilize the unlicensed bands without jeopardizing other unlicensed-band users, e.g., Wi-Fi users (WUs), remain as open problems. In this letter, we aim to optimize the allocation of radio resources in both licensed and unlicensed bands in an LTE-U and Wi-Fi coexisting scenario, where a CU can be allocated either a licensed or unlicensed band. We formulate a multi-objective optimization problem to maximize every CU's utility, while guaranteeing the throughput requirements of both CUs and WUs. We propose an algorithm based on one-to-one and many-to-one matching algorithms to solve it. The stability, Pareto optimality, and convergence of the proposed matching-based algorithm are proven. Simulation results show that the proposed algorithm can achieve near-optimal performance but with a low computational complexity.