• DocumentCode
    3081057
  • Title

    A Game Theoretic Approach for the Cooperative Network with the Presence of Malicious Relays

  • Author

    Chen, Meng-Hsi ; Lin, Shih-Chun ; Hong, Y. -W Peter

  • Author_Institution
    Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Cooperative relaying refers to a technique that allows the source to transmit its messages to the destination via the relaying of multiple cooperative partners and exploits the spatial diversity gains inherent in multiuser wireless systems. In this work, we examine cooperative networks with cooperative and malicious relays and determine the optimal behavior for both kinds of relays using a game-theoretic approach. We formulate the problem as a zero-sum game, determining the optimal relay strategies by identifying the Nash equilibrium of the proposed game under individual power constraints. We prove, with Rayleigh fading, the optimal strategy for malicious relays is to transmit independent Gaussian noise using full power at each relay and for cooperative relays is to independently re-encode the source´s message into Gaussian signals and forward them to the destination. Inter-cooperation among relays is unnecessary. The results are verified through numerical simulations.
  • Keywords
    Gaussian noise; Rayleigh channels; cooperative communication; diversity reception; game theory; multi-access systems; radio networks; telecommunication security; Gaussian noise; Gaussian signal; Nash equilibrium; Rayleigh fading; cooperative network; cooperative relaying; game theory; malicious relay; multiuser wireless system; optimal relay strategy; spatial diversity gain; zero-sum game; Covariance matrix; Game theory; Games; MIMO; Neodymium; Relays; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
  • Conference_Location
    Houston, TX, USA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-9266-4
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2011.6134206
  • Filename
    6134206