Distributed Channel Selection in Time-Varying Radio Environment: Interference Mitigation Game With Uncoupled Stochastic Learning

Abstract

This paper investigates the problem of distributed channel selection for interference mitigation in a time-varying radio environment without information exchange. Most existing algorithms, which were originally designed for static channels, are costly and inefficient in the presence of time-varying channels. First, we formulate this problem as a noncooperative game, in which the utility of each player is defined as a function of its experienced expected weighted interference. This game is proven to be an exact potential game with the considered network utility (the expected weighted aggregate interference) serving as the potential function. However, most game-theoretic algorithms are not suitable for the considered network, since they are coupled, i.e., the updating procedure is relying on the actions or payoffs of other players. Then, we propose a simple, completely distributed, and uncoupled stochastic learning algorithm, with which the users learn the desirable channel selections from their individual trial-payoff history. It is analytically shown that the proposed algorithm converges to pure strategy Nash equilibrium in time-varying radio environment; moreover, it achieves optimal channel selection profiles and makes the network interference-free for underloaded or equally loaded scenarios, while achieving, on average, near-optimal performance for overloaded scenarios.