O. Semiari, W. Saad and M. Bennis, "Joint Millimeter Wave and Microwave Resources Allocation in Cellular Networks With Dual-Mode Base Stations," in IEEE Transactions on Wireless Communications, vol. 16, no. 7, pp. 4802-4816, July 2017. doi: 10.1109/TWC.2017.2703109
Joint millimeter wave and microwave resources allocation in cellular networks with dual-mode base stations
|Author:||Semiari, Omid1; Saad, Walid1; Bennis, Mehdi2|
1Wireless@VT, Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24061, USA
2Center for Wireless Communications, University of Oulu, Oulu 90014, Finland
|Online Access:||PDF Full Text (PDF, 2.2 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2018080633384
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2018-08-06
The use of dual-mode base stations that can jointly exploit millimeter wave (mmW) and microwave (μW) resources is a promising solution for overcoming the uncertainty of the mmW environment. In this paper, a novel dual-mode scheduling framework is proposed that jointly performs user applications (UAs) selection and scheduling over μW and mmW bands. The proposed scheduling framework allows multiple UAs to run simultaneously on each user equipment (UE) and utilizes a set of context information, including the channel state information per UE, the delay tolerance and required load per UA, and the uncertainty of mmW channels, to maximize the quality-of-service (QoS) per UA. The dual-mode scheduling problem is then formulated as an optimization problem with minimum unsatisfied relations problem, which is shown to be challenging to solve. Consequently, a long-term scheduling framework, consisting of two stages, is proposed. Within this framework, first, the joint UA selection and scheduling over the μW band is formulated as a one-to-many matching game between the μW resources and UAs. To solve this problem, a novel scheduling algorithm is proposed and shown to yield a two-sided stable resource allocation. Second, over the mmW band, the joint contextaware UA selection and scheduling problem is formulated as a 0–1 Knapsack problem and a novel algorithm that builds on the Q-learning algorithm is proposed to find a suitable mmW scheduling policy while adaptively learning the UEs’ line-of-sight probabilities. Furthermore, it is shown that the proposed scheduling framework can find an effective scheduling solution, over both μW and mmW, in polynomial time. Simulation results show that, compared with conventional scheduling schemes, the proposed approach significantly increases the number of satisfied UAs while improving the statistics of QoS violations and enhancing the overall users’ quality-of-experience.
IEEE transactions on wireless communications
|Pages:||4802 - 4816|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work was supported by the U.S. National Science Foundation under Grant CNS-1460316.
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.