Channel allocation algorithms for multi-carrier multiple-antenna systems
Signal Processing - Special section: Advances in signal processing-assisted cross-layer designs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband
3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband
Chunk-based resource allocation in OFDMA systems: part I: chunk allocation
IEEE Transactions on Communications
LTE, the radio technology path towards 4G
Computer Communications
Expert Systems with Applications: An International Journal
Performance prediction for OFDMA systems with dynamic power and subcarrier allocation
Computer Communications
Computationally efficient bandwidth allocation and power control for OFDMA
IEEE Transactions on Wireless Communications
Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints
IEEE Transactions on Wireless Communications
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Transmit power adaptation for multiuser OFDM systems
IEEE Journal on Selected Areas in Communications
Automated network selection in a heterogeneous wireless network environment
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.08 |
A computationally efficient algorithm, referred to as the multi-criteria ranking based greedy (MCRG) algorithm, is proposed for physical resource block (PRB) allocation in multi-carrier wireless communications systems, where the users' utilities are ranked with multiple criteria. The MCRG algorithm not only outperforms the previous single criterion ranking based greedy algorithm in terms of throughput and outage probability, but also provides a near optimal performance, irrespective of whether the channel frequency response (CFR) or bit error rate (BER) or throughput optimisation utilities are used. In particular, when the MCRG algorithm is used to optimise the CFR utility, the overall computational complexity is kept at a very low level, without sacrificing the performance. To further reduce the overall computational complexity, a selectivity ratio is included in the MCRG algorithm, where greedy PRB allocation is applied only to a selection of users with lower multi-criteria ranking.