Game theoretic resource allocation form-dependent channels with application to OFDMA

Abstract

In this paper we consider the problem of channel allocation for users who access a common channel using OFDMA. The spectrum is divided into subchannels and we assume that the bandwidth of each subchannel is smaller than the coherence bandwidth. This leads to correlations between the channel coefficients for each user. We model these correlated channels as an m-dependent sequence and generate an interference game at random, according to some marginal fading distribution. Performance is measured by the sum of achievable rates. Using a novel analysis of the random pure NE of the game, we prove that even for correlated channels the M-frequency selective interference game, suggested in previous work, has only Nash equilibria that exhibit good performance with high probability, asymptotically with the number of users. This game is the basis for an asymptotically optimal and fully distributed OFDMA channel allocation algorithm, presented in simulations.