Abstract:

A mixed strategy algorithm based on the mixed-game theory is presented to maximize the node overall throughput in asymmetric multi-channel Ad hoc networks. First, a simple saturation throughput model is presented to quantify to the utility of each node, then, the mixed-game Nash equilibrium model is used to analyze the channel selections. At last, the mixed strategy channel selection algorithm is proposed to maximize the throughput and also improve the fairness of channel selections. Simulation results show that the algorithm can achieve at least 15% improvement compared with random strategy and shared channel selections in multi-user scenarios.

Key words: Ad hoc networks, mixed-game, channel selection, throughput