• DocumentCode
    6410
  • Title

    Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms

  • Author

    Scutari, Gesualdo ; Jong-Shi Pang

  • Author_Institution
    Dept. of Electr. Eng., State Univ. of New York at Buffalo, Buffalo, NY, USA
  • Volume
    59
  • Issue
    7
  • fYear
    2013
  • fDate
    Jul-13
  • Firstpage
    4626
  • Lastpage
    4661
  • Abstract
    In this paper, we propose a novel class of Nash problems for cognitive radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation. The proposed general formulation allows us to accommodate several (transmit) power and (deterministic/probabilistic) interference constraints, such as constraints on the maximum individual and/or aggregate (probabilistic) interference tolerable at the primary receivers. To keep the optimization as decentralized as possible, global (coupling) interference constraints are imposed by penalizing each SU with a set of time-varying prices based upon his contribution to the total interference; the prices are thus additional variable to optimize. The resulting players´ optimization problems are nonconvex; moreover, there are possibly price clearing conditions associated with the global constraints to be satisfied by the solution. All this makes the analysis of the proposed games a challenging task; none of classical results in the game theory literature can be successfully applied. The main contribution of this paper is to develop a novel optimization-based theory for studying the proposed nonconvex games; we provide a comprehensive analysis of the existence and uniqueness of a standard Nash equilibrium, devise alternative best-response based algorithms, and establish their convergence. Some of the proposed algorithms are totally distributed and asynchronous, whereas some others require limited signaling among the SUs (in the form of consensus algorithms) in favor of better performance; overall, they are thus applicable to a variety of CR scenarios, either cooperative or noncooperative, which allows the SUs to explore the existing tradeoff between signaling and performance.
  • Keywords
    Gaussian channels; cognitive radio; concave programming; distributed algorithms; game theory; probability; radio receivers; radiofrequency interference; CR network; Gaussian frequency-selective interference channel; Nash equilibria; best-response based algorithm; cognitive radio network; deterministic interference constraint; distributed algorithm; game theory; global coupling interference constraint; joint sensing; nonconvex cognitive radio game; nonconvex game; opportunistic throughput; optimization-based theory; player optimization problem; primary receiver; probabilistic interference constraint; secondary user; standard Nash equilibrium; time-varying price; vector power allocation; Algorithm design and analysis; Convergence; Games; Interference constraints; Joints; Optimization; Sensors; Cognitive radio; distributed algorithms; game theory; quasi-Nash equilibrium; spectrum sensing; variational inequalities;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2013.2239354
  • Filename
    6409459