Joint channel and traffic assignment in Ad Hoc networks using game theory with charging scheme

Channel assignment is a significant challenge due to scarcity of number of channels available in multi-channel multi-radio Ad Hoc networks. Meanwhile, traffic allocation is a problem worthy of research especially in the situation that different traffic demands for different users. In this paper, we formulate the problem of joint channel and traffic assignment as a static non-cooperative game with charging scheme, taking into account the different individual demand constraints, the number of channels, and the number of radios. To some extent, the charging scheme alleviates the unfairness problem. We show the existence of Nash Equilibrium (NE) and derive the sufficient and necessary conditions to be NE. Then, the uniqueness of the Nash Equilibrium is demonstrated under reasonable conditions. Finally, we extend the algorithm to multiple collision domains. The simulation results illustrates the algorithm is efficient and has a better performance.