A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

详细信息    查看全文

• 作者：Rohith Dwarakanath Vallam (1) rohithdv@csa.iisc.ernet.in
  Arun A. Kanagasabapathy (2) akanagasaba1@bloomberg.net
  C. Siva Ram Murthy (3) murthy@iitm.ac.in
• 关键词：Multi ; channel multi ; radio wireless networks – ; Channel assignment – ; Centralized and distributed algorithms – ; Game theory
• 刊名：Wireless Networks
• 出版年：2011
• 出版时间：February 2011
• 年：2011
• 卷：17
• 期：2
• 页码：411-435
• 全文大小：1.4 MB

文摘

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.