Resource Scheduling for OFDMA/TDD Based Relay Enhanced Cellular Networks

Relay enhanced cellular network has been proposed as a promising solution for the next generation wireless system. Based on an appropriate frame structure for such OFDMA based relay network, round-robin algorithm is extended as a performance benchmark. Two special algorithms (greedy polling and partial proportional fair) are proposed for adaptive resource scheduling. Throughput results of simulations show that the proposed adaptive algorithms can achieve significant improvement on system performance and the relay enhanced cellular network outperforms the traditional network significantly for supplying high data rate for users at the cell´s edge. The results of jitter´s deviation indicate greedy polling algorithm is applicable to realtime service and partial proportional fair algorithm is suitable for non-realtime service.