On a Cognitive Radio Network's Random Access Game With a Poisson Number of Secondary Users

In this letter a random access algorithm based on game theory for cognitive radio networks with random number of secondary users is investigated. The scenario examines a non-cooperative game in which all the players are unaware of the total number of devices participating (population uncertainty). We proposed a scheme where failed attempts to transmit (collisions) are penalized and, consequently, the optimum penalization in mixed strategies is calculated. Furthermore, an analytical approximation for the corresponding Pareto fronts which maximizes the throughput of individual secondary users is obtained. Finally, the impact that the presence of primary users have on the optimal access strategy is assessed.