Perfectly fair channel assignment in non-cooperative multi-radio multi-channel wireless networks

The channel assignment problem is very important in wireless networks. In this letter, we study the non-cooperative channel assignment problem in competitive multi-radio multi-channel wireless networks, with a focus on fairness issues. We propose a Nash equilibrium solution with stronger guarantee on fairness among players than existing works, by requiring a payment from each player. We show that, in our scheme, when system converges to a stable status achieving Nash equilibrium, all players obtain the same throughput. Simulation results verify that our scheme achieves perfect fairness.