Evaluation for Various Resource Allocation Methods for Multiuser-MIMO OFDMA Systems

Abstract

A simple algorithm to select user-pair and allocate frequency band is proposed for multiuser-MIMO OFDMA systems. For sake of comparison, various resource allocation algorithms, such as max-throughput, best-fit, first-fit, and random-fit algorithm, are examined with regard to the system throughput, computational complexity, and fairness among the users. Computer simulation results show that the first-fit algorithm can achieve a large reduction of computation for resource allocation as well as good fairness among users, with only a small reduction of throughput.

Power Efficient Resource Allocation for Downlink OFDMA Relay Cellular Networks

“…Noting that the object function in (36) is to minimize , without loss of generality, we can set in (A.6) as a minimum-distance least squares solution for the underdetermined equality. Consequently, we can show (36c) from (A.6) as Similarly, using (26) in the QoS constraint (23), we can show (36d).…”

“…The modified problem is a linear assignment problem and it can be readily solved by using any linear assignment algorithms, such as the Hungarian, Edmonds-and-Karp's, and network flow algorithms [25]. Also, there are many efficient suboptimal algorithms to solve (33), e.g., a best-fit algorithm assigning the best available resource to a user sequentially [26]. The number of candidates for all cells, i.e., combinations of , is reduced to .…”