A modified greedy resource allocation algorithm for OFDMA based networks

This paper presents a modified greedy algorithm for allocating resource blocks (RBs) and power in downlink of OFDMA based networks. This algorithm considers the location of users in the power allocation process. Furthermore, for inter-cell interference coordination, an interference graph is used. Using this graph, RBs are allocated to those users that do not experience severe interference in that RB. At the first, the user with the maximum average SINR is chosen and then the RB with maximum SINR (among those RBs that are not selected yet) is chosen. The power is allocated in three predefined levels according to the distance of users from their serving and interferer BSs. Comparing with traditional greedy algorithms, the proposed algorithm utilizes more degrees of freedom in resource allocation process, and considers different power levels for different users according to their locations in the cell. Simulation results show that our modified greedy algorithm improves the throughput of cell edge users compared with the other schemes.