An efficient and generic downlink resource allocation procedure for pre-5G networks
This paper addresses the downlink resource allocation problem in pre-5G (LTE-B) networks. At each time slot, the problem is to share the radio resources between users in order to maximize a given objective function. We expressed this problem considering the LTE standard constraints, which are rarely considered in the literature. Mainly, for any given user, the base station is constrained to transmit with a single Modulation and Coding Scheme (MCS). We show that this problem is NP-Hard, and therefore, we propose a generic approximation algorithm which covers a large variety of objectives. This algorithm is composed of three routines that enable an effective resource sharing procedure. The first routine computes a solution for a relaxation of our main problem, while the second routine selects the most suitable MCS for each user. Finally, the last routine effectively distributes the unallocated resources. For the Max Rate policy, simulation results show that our algorithm outperforms other existing algorithms in terms of capacity, and remains close to the optimal. Under the Proportional Fairness policy, our solution also provides a very good fairness while maintaining a near-optimal capacity.
ISSN: 1530-8669 EISSN: 1530-8677 Wireless Communications and Mobile Computing http://hal.upmc.fr/hal-01445121 Wireless Communications and Mobile Computing, Wiley, 2016, 16 (17), pp.3089 - 3103. <10.1002/wcm.2735>ARRAY(0x7f4f38fba498) 2016-12-10