• DocumentCode
    2888859
  • Title

    A reinforcement learning optimization framework for cognitive interference networks

  • Author

    Levorato, Marco ; Firouzabadi, Sina ; Goldsmith, Andrea

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
  • fYear
    2011
  • fDate
    28-30 Sept. 2011
  • Firstpage
    1633
  • Lastpage
    1640
  • Abstract
    A Reinforcement Learning (RL) algorithm for the optimization of secondary user´s transmission strategies in cognitive networks is presented. The secondary user minimizes a cost function while generating a bounded performance loss to the primary users´ network. The state of the primary users´ network, defined as a collection of variables describing features of the network (e.g., buffer state, ARQ state) evolves over time according to a homogeneous Markov process. The statistics of the Markov process is dependent on the strategy of the secondary user and, thus, the instantaneous idleness/transmission action of the secondary user has a long-term impact on the temporal evolution of the network. The proposed RL algorithm finds the optimal randomized past-independent policy from a sample path of state-cost observations without any a priori knowledge of the statistics of the Markov process. The performance and structure of the policy resulting from the proposed RL algorithm is compared to those of the policy identified by the algorithm in[l].
  • Keywords
    Markov processes; automatic repeat request; cognitive radio; inference mechanisms; learning (artificial intelligence); optimisation; random processes; statistical analysis; telecommunication computing; ARQ state; RL algorithm; bounded performance loss; buffer state; cognitive interference networks; cognitive networks; cost function; homogeneous Markov process; optimal randomized past-independent policy; primary users network; reinforcement learning algorithm; reinforcement learning optimization framework; secondary user transmission strategy; state-cost observations; statistics; temporal network evolution; Automatic repeat request; Cost function; Markov processes; Protocols; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on
  • Conference_Location
    Monticello, IL
  • Print_ISBN
    978-1-4577-1817-5
  • Type

    conf

  • DOI
    10.1109/Allerton.2011.6120364
  • Filename
    6120364