• DocumentCode
    1386968
  • Title

    Bargaining Game Theoretic Framework for Stimulating Cooperation in Wireless Cooperative Multicast Networks

  • Author

    Zhang, Guopeng ; Yang, Kun ; Hu, Qingsong ; Liu, Peng ; Ding, Enjie

  • Author_Institution
    Internet of Things Res. Center, China Univ. of Min. & Technol., Xuzhou, China
  • Volume
    16
  • Issue
    2
  • fYear
    2012
  • fDate
    2/1/2012 12:00:00 AM
  • Firstpage
    208
  • Lastpage
    211
  • Abstract
    This Letter proposes a multi-player bargaining game to stimulate selfish receiving nodes to participate in cooperative multicasts (CMs). In the game, the source node can reward the relaying nodes by, in return, forwarding messages originated from the relays. And all the cooperative nodes aim to achieve optimal data-rate gains through the game. Define the cooperative strategy of a node as the number of data-symbols (in one data-frame) that it is willing to relay for the cooperative partner nodes. We can prove that the game has a unique Nash bargaining solution (NBS). Simulation results show that the proposed NBS based CM scheme can achieve Pareto optimal rate allocation among the cooperative nodes. The source node can achieve significant rate-gain in comparison with direct multicast and the relay nodes can also get fair rate-rewards from the source according to the level of contribution that they have made to improve the performance of the source.
  • Keywords
    Pareto optimisation; cooperative communication; game theory; multicast communication; NBS based CM scheme; Nash bargaining solution; Pareto optimal rate allocation; data-symbol; game theoretic framework; multiplayer bargaining game; rate-rewards; relay node; wireless cooperative multicast network; Games; NIST; Pareto optimization; Relays; Resource management; Simulation; Wireless communication; Cooperative multicast; Nash bargaining solution; bargaining game; spatial diversity;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2011.112311.111518
  • Filename
    6093987