Title
A Bargaining Game For Channel Access In Dynamic Spectrum Access Networks
Abstract
In this paper, we model the problem of dynamic spectrum access by a set of cognitive radio enabled nodes as an infinite horizon bargaining game. Each node (or, player) negotiates with its interfering nodes to obtain an agreeable sharing rule of the available channels.We investigate the subgame perfect equilibrium strategies of the bargaining game, abiding by which, each node can maximize its throughput against all its interfering nodes (opponents). We further study the issue of fairness in this model, in terms of the relative number of channels allocated to the nodes. Moreover, each node bargains with its interfering neighbors independently and in a distributed manner, making the system scalable. ©2010 IEEE.
Publication Date
12-1-2010
Publication Title
GLOBECOM - IEEE Global Telecommunications Conference
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/GLOCOM.2010.5684321
Copyright Status
Unknown
Socpus ID
79551640366 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/79551640366
STARS Citation
Brahma, Swastik and Chatterjee, Mainak, "A Bargaining Game For Channel Access In Dynamic Spectrum Access Networks" (2010). Scopus Export 2010-2014. 314.
https://stars.library.ucf.edu/scopus2010/314