• DocumentCode
    2015986
  • Title

    Spectrum management and power allocation in MIMO cognitive networks

  • Author

    Nguyen, Diep N. ; Krunz, Marwan

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA
  • fYear
    2012
  • fDate
    25-30 March 2012
  • Firstpage
    2023
  • Lastpage
    2031
  • Abstract
    We consider the problem of maximizing the throughput of a multi-input multi-output (MIMO) cognitive radio (CR) network. CR users are assumed to share the available spectrum without disturbing primary radio (PR) transmissions. With spatial multiplexing performed over each frequency band, a multi-antenna CR node controls its antenna radiation patterns and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one for each band) at each CR node so that power and spectrum are optimally allocated for that node (in terms of throughput) and its interference is steered away from other CR and PR transmissions. In other words, the problems of power, spectrum and interference management are jointly investigated. We formulate a multi-carrier MIMO network throughput optimization problem subject to frequency-dependent power constraints. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. Such a problem is difficult to solve, even in a centralized manner. To tackle it, we translate it into a noncooperative game and derive an optimal pricing policy for each node, which adapts to the node´s neighboring conditions and drives the game to a Nash-Equilibrium (NE). The network throughput under this NE is at least equal to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (the best response), a low-complexity distributed algorithm is developed by exploiting the strong duality of the per-user convex optimization problem. The number of variables in the distributed algorithm is independent of the number of antenna elements. A centralized (cooperative) algorithm is also developed, serving as a performance benchmark. Simulations show that the network throughput under the distributed algorithm converges rapidly to that of the centralized one. The fast convergence of the g- me facilitates MAC design, which we briefly discuss in the paper. The application of our results is not limited to CR systems, but extends to multi-carrier (e.g., OFDM) MIMO systems.
  • Keywords
    MIMO communication; access protocols; antenna arrays; antenna radiation patterns; cognitive radio; concave programming; convex programming; distributed algorithms; game theory; matrix algebra; radiofrequency interference; telecommunication network management; CR node; CR transmissions; CR users; MIMO cognitive networks; NE; Nash equilibrium; PR transmissions; antenna elements; antenna radiation patterns; centralized algorithm; data stream; frequency-dependent power constraints; game facilitates MAC design; interference management; low-complexity distributed algorithm; multiantenna CR node controls; multicarrier MIMO network; multiinput multioutput cognitive radio network; nonconvex centralized problem; noncooperative game; optimal pricing policy; per-user convex optimization problem; power allocation; precoding matrix; primary radio transmissions; spectrum management; Games; Interference; MIMO; Optimization; Pricing; Resource management; Throughput; MAC protocol; MIMO; Noncooperative game; beamforming; cognitive radio; frequency management; power allocation; pricing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2012 Proceedings IEEE
  • Conference_Location
    Orlando, FL
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4673-0773-4
  • Type

    conf

  • DOI
    10.1109/INFCOM.2012.6195583
  • Filename
    6195583