Provided by: Syracuse Research
Date Added: Mar 2012
In this paper, the authors address the problem of dynamic channel access by a set of cognitive radio enabled nodes (e.g., broadcast access points), where each node acting in a selfish manner tries to access and use as many channels as possible, subject to the interference constraints. They model the dynamic channel access problem as a modified Rubinstein-Stahl bargaining game. In their model, each node (player) negotiates with the other nodes to obtain an agreeable sharing rule of the available channels, such that, no two interfering nodes use the same channel. They solve the bargaining game by finding Sub-game Perfect Nash Equilibrium (SPNE) strategies of the game.