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

Abstract

Abstract-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 coalitionproof 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.

An Energy-efficiency Node Scheduling Game Based on Task Prediction in WSNs

“…In [29], M. Abdeyazdan et al consider each task as a player attempting to reduce its earliest time as much as possible, and applied the idea of Nash equilibrium in game theory to determine the most appropriate merging. Gao et al present a hybrid game approach which contains both cooperative behavior and competitive behavior for multi-hop wireless networks [30]. Wang et al formulate a spectrum allocation problem in cognitive radio networks based on bandwidth auction, which is a non-cooperative game [31].…”

Simulation of multi-radio multi-channel 802.11-based mesh networks in ns-3

“…SICA is distributed and assumes that in wireless networks, nodes do not have perfect information about their neighbors. This is the main contribution that differentiates SICA from other game-based CAs [24,[49][50][51][52][53][54][55]. Moreover, nodes do not need to tune one radio interface over a common channel.…”

Adaptive Channel Assignment for Wireless Mesh Networks using Game Theory

“…Although the algorithm converges to a stable Nash Equilibrium but their work is limited to single collision domain. Further extensions of this work for multi hop networks in one collision domain are presented in [8], [10]. Kim et al [10] did not put any constraints for the number of radios per node.…”

“…Channel assignment algorithms using game theory models have been studied recently in some works [5], [8], [9]. None of the proposed algorithms considers the effect of co-channel interference.…”

“…The proposed game should played sequentially and channels should be reallocated for any changes in the traffic profile. The approaches proposed in [8] formulates the channel assignment as a cooperative game but channel reallocation is necessary for changes in traffic sessions. Shah et al [9] formulate the game for multiple collision domains, but they use a static game which is limited to find an equilibrium for competing flows.…”