Dynamic Optimization for Resource Allocation in Relay-Aided OFDMA Systems Under Multiservice

摘要

This paper investigates the dynamic resource allocation (RA) problem in cooperative OFDMA systems to maximize the average utility of all mobile stations (MSs) under different services. We propose a dynamic optimization framework for RA by considering three dynamic situations: time-varying fading channel, MSs' change of states, and relay stations (RSs)' change of states. Moreover, a dynamic RA algorithm based on discrete particle swarm optimization (DPSO) is proposed. The correlation between the adjacent frames is exploited to improve the performance of the dynamic RA algorithm. Simulation results show that the proposed dynamic algorithm achieves better performance at linear complexity, compared with the existing algorithms under different dynamic environments, while guaranteeing fairness to a proper level.