Resource Matching in Carrier Aggregation Enabling 5G Networks

作者：Alam M Jawad^*; Ma Maode

来源：Wireless Personal Communications, 2017, 95(2): 1229-1248.

DOI：10.1007/s11277-016-3826-3

• 5G
• Stable matching
• Resource allocation
• Downlink scheduling
• Uplink scheduling
• Carrier aggregation

Carrier aggregation (CA) is one of the main enabling technologies for the 5G wireless networks. The CA increases overall bandwidth of the wireless networks for both uplink and downlink. In 5G wireless networks, both 5th and earlier generation users need to assign resources over the aggregated bandwidth. Earlier scheduling mechanisms cannot be applied directly to 5G wireless networks with the CA. A mechanism is needed to support resource scheduling over the aggregated bandwidth. Recent work on the resource scheduling has considered component carrier selection, resource allocation and link adaption as separate issues. In this paper, we model the problem as a matching game. Game theory is utilized for the resource matching in the proposed algorithm with a matching game model designed to match resources. Stable matching problems match two sets of candidates such that the outcome is stable. With a stable outcome, there is no incentive for candidates on either side to form a new pair. This paper introduces the concept of using the matching game for resource allocation in the carrier aggregated 5G wireless networks. The proposed algorithm considers channel conditions while matching resources. A cross-carrier resource allocation method is used, and stable matching is completed with the matching game.

• 出版日期2017-7
• 单位南阳理工学院