Communication and Block Game in Cognitive Radio Networks

In this paper, we initiate the Communication and Block Game between two unlicensed users and an adversary in Cognitive Radio Networks (CRNs). In each time slot, the two unlicensed users can successfully communicate on the common available channel if it is not blocked by the adversary. In the communication and block game, the two unlicensed users aim to maximize their communication load, denoted as the number of time slots of their successful communications, while the adversary aims to minimize it. We propose efficient algorithms for both users and the adversary and we prove the proposed algorithms will lead a Nash Equilibrium, i.e. the users can achieve the maximum communication load against any adversary's blocking strategy, while the adversary can minimize the users' communication load against any users' channel accessing strategy. We also present efficient algorithms for both users and adversary for the multiple channels scenario where the users and the adversary are equipped with multiple radios. These algorithms also guarantee high communication load for the users, while the adversary can also block a considerable number of users' communications. Our simulations validate the theoretical analyses.