• DocumentCode
    2976225
  • Title

    Minimax games for cooperative spectrum sensing in a centralized cognitive radio network in the presence of interferers

  • Author

    Nadendla, V. Sriram Siddhardh ; Chen, Hao ; Varshney, Pramod K.

  • Author_Institution
    Dept. of EECS, Syracuse Univ., New York, NY, USA
  • fYear
    2011
  • fDate
    7-10 Nov. 2011
  • Firstpage
    1256
  • Lastpage
    1260
  • Abstract
    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.
  • Keywords
    cognitive radio; convex programming; cooperative communication; error statistics; game theory; minimax techniques; radiofrequency interference; centralized cognitive radio network; cooperative spectrum sensing; error probability; fixed interferer; fusion center; interferer parameters; minimax games; monotone function; quasiconvex function; saddle-point; Cognitive radio; Equations; Error probability; Games; Measurement; Nash equilibrium; Sensors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    MILITARY COMMUNICATIONS CONFERENCE, 2011 - MILCOM 2011
  • Conference_Location
    Baltimore, MD
  • ISSN
    2155-7578
  • Print_ISBN
    978-1-4673-0079-7
  • Type

    conf

  • DOI
    10.1109/MILCOM.2011.6127473
  • Filename
    6127473