Distributed Multi-Radio Channel Allocation in Multi-Hop Ad Hoc Networks

Channel allocation was extensively researched in the framework of cellular networks, but it was rarely studied in the ad-hoc wireless networks, especially in the multi-hop ad-hoc networks. In this paper, we study the problem of competitive multi-radio multi-channel allocation in multi-hop wireless networks in detail. We model the channel allocation problem as a static cooperative game, and then derive a min-max coalition-proof Nash equilibrium (MMCPNE) in this game. We study the existence of MMCPNE in the static game and prove the necessary and sufficient conditions for MMCPNE. Finally, we propose a two-step distributed algorithm that enable the selfish players to converge to MMCPNE.