Game theoretic channel allocation for the delay-sensitive cognitive radio networks

In this paper, we propose several channel allocation schemes via the Game theoretical approaches for the distributed CR networks. Distinguished from the literature, more important factors are taken into account when designing the potential games for the interweave and underlay CR networks, i.e. the queueing delay, complete inter-system interference and protection of primary users (PUs). Particularly, in the underlay CR networks, a PU can be protected by adaptively adjusting the cost for secondary users (SUs) to share a subchannel with him. Consequently, SUs and PUs can achieve higher end-to-end throughput and maintain the desired signal-to-noise-and-interference ratio, respectively. Moreover, for proving the convergence of the proposed schemes, the associated potential functions are also defined. Via the simulation results, the proposed schemes are proved to be capable of effectively reducing the queuing delay at the cost of the slightly decreased throughput.