• DocumentCode
    1726651
  • Title

    A Nash-Stackelberg Multiplicative Weighted Imitative CODIPAS-RL scheme for data relaying and handover management in wireless networks

  • Author

    Saleem, Muhammad Shamoon ; Renault, Eric

  • Author_Institution
    Inst. Mines - Telecom, Telecom SudParis, Evry, France
  • fYear
    2013
  • Firstpage
    587
  • Lastpage
    592
  • Abstract
    This paper presents a Price-Reward learning scheme to encourage mutual coordination between mobile nodes and their wireless networks. In order to maximize the overall network coverage through cooperative diversity, a Nash-Stackelberg Multiplicative Weighted Imitative CODIPAS-RL scheme is proposed based on our previous work. The wireless network implements a 2-level Stackelberg game by introducing Price-Reward (λ,μ) parameters whereas the Reinforcement Learning (RL) scheme paves the way for mobile nodes to reach a Nash-Equilibrium state. The performance evaluation of the learning scheme for the presented scenario proves fast convergence towards the optimal solution by adopting different sets of actions for the selected strategies. This ensures QoS sustainability during handover situations by data relaying and avoids collisions among mobile nodes while accessing network resources.
  • Keywords
    Internet; cooperative communication; diversity reception; game theory; mobility management (mobile radio); quality of service; radio networks; 2-level Stackelberg game; Internet; Nash-Equilibrium state; Nash-Stackelberg multiplicative weighted imitative CODIPAS-RL scheme; QoS sustainability; RL scheme; cooperative diversity; data relaying; handover management; handover situations; mobile nodes; mutual coordination; price-reward learning scheme; reinforcement learning scheme; wireless networks; Games; Handover; Mobile nodes; Throughput; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Consumer Communications and Networking Conference (CCNC), 2013 IEEE
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    978-1-4673-3131-9
  • Type

    conf

  • DOI
    10.1109/CCNC.2013.6488503
  • Filename
    6488503