Game-Theoretic Approach to Distributed Scheduling for Relay-Aided OFDMA Systems

In order to guarantee the high quality of service (QoS) even for cell edge users and deeply shadowed users, future cellular networks are expected to deploy relay stations (RSs). For fully exploiting the newly deployed RSs, the centralized scheduling at the base station (BS) have been widely studied due to its ability to provide optimal use of wireless resources and RSs. However, severe burden for channel reporting can be imposed by the centralized scheduling since the BS should collect every channel gain not only between BS and mobile stations (MSs) but also between each RS and MSs. To cope with this high overhead problem, we propose a distributed scheduling scheme which exploits the frequency reuse and provides high QoS to MSs, based on the game theoretic framework. The simulation results show that the proposed scheme can obtain higher throughput than the centralized scheme while the outage probability of the proposed scheme is similar to that of the centralized scheme.