Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Assignment Problems
Transmit Antenna Selection for the Distributed MIMO Systems
NSWCTC '09 Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02
LTE for UMTS - OFDMA and SC-FDMA Based Radio Access
LTE for UMTS - OFDMA and SC-FDMA Based Radio Access
Opportunistic packet scheduling in OFDM distributed antenna systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Low-complexity resource allocation and its application to distributed antenna systems
IEEE Wireless Communications
Distributed Antenna Systems with Randomness
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Distributed antennas are envisaged for LTE-Advanced deployments in order to improve the coverage and increase the cell throughput. The latter in turn depends on how resources are allocated to the User Equipments (UEs) at the MAC layer. In this paper we discuss how to allocate resources to UEs so as to maximize the cell throughput, given that UEs may receive from several antennas simultaneously. We first show that the problem is both NP-hard and APX-hard, i.e. no polynomial-time algorithm exists that approximates the optimum within a constant factor. Hence, we propose and evaluate two polynomial-time heuristics whose complexity is feasible for practical purposes. Our simulative analysis shows that, in practical scenarios, the two heuristics are highly accurate.