Minimax Games for Cooperative Spectrum Sensing in a Centralized Cognitive Radio Network in the Presence of Interferers
In this paper, we consider the problem of interferers for cooperative spectrum sensing in a centralized cognitive radio network comprising N cognitive radios (CRs) and one fusion center (FC) in the presence of a fixed interferer. The design metric chosen is the error probability. We prove the existence of a saddle-point in the minimax game between the interferer and the CR network. An optimal solution is found that maximizes the objective with respect to the interferer's parameters and minimizes the same with respect to the CR network's parameters. We show that the probability of error is a quasi-convex function with respect to the network's parameters and a monotone function with respect to the interferer's parameters. We also present numerical results that corroborate our theoretical results.
V. S. Nadendla et al., "Minimax Games for Cooperative Spectrum Sensing in a Centralized Cognitive Radio Network in the Presence of Interferers," Proceedings of the 2011 IEEE Military Communications Conference (2011, Baltimore, MD), pp. 1256-1260, Institute of Electrical and Electronics Engineers (IEEE), Nov 2011.
The definitive version is available at https://doi.org/10.1109/MILCOM.2011.6127473
2011 IEEE Military Communications Conference, MILCOM 2011 (2011: Nov. 7-10, Baltimore, MD)
Keywords and Phrases
A-Monotone; Cognitive Radio; Cognitive Radio Network; Cooperative Spectrum Sensing; Error Probabilities; Fusion Center; Minimax Games; Numerical Results; Optimal Solutions; Probability Of Errors; Quasiconvex Functions; Saddle Point; Theoretical Result, Military Communications
International Standard Book Number (ISBN)
Article - Conference proceedings
© 2011 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
01 Nov 2011