• DocumentCode
    3247568
  • Title

    Energy Efficient Relaying Games in Cooperative Wireless Transmission Systems

  • Author

    Yang, Jie ; Brown, D. Richard, III

  • Author_Institution
    Worcester Polytech. Inst., Worcester
  • fYear
    2007
  • fDate
    4-7 Nov. 2007
  • Firstpage
    835
  • Lastpage
    839
  • Abstract
    In wireless networks, intermediate nodes are often used as relays to reduce the transmission energy required to deliver a message to an intended destination. The selfishness of autonomous nodes, however, raises concerns about their willingness to expend energy to relay information for others. This paper considers the effect of selfishness on energy efficiency using a non-cooperative game theoretic approach. A two-source relaying game is formulated for both non-fading and fading scenarios. We show that cooperative transmission with optimum energy allocation is a Nash Equilibrium in non-fading channels when the sources are sufficiently patient. In fading channels, cooperative transmission with optimum energy allocation is also a Nash Equilibrium when a ceiling is applied to the relay energy of each source. Simulation results show that sources acting in their own self-interest can achieve an energy efficiency close to that of centrally optimized energy allocation in many cases.
  • Keywords
    fading channels; game theory; radio networks; Nash Equilibrium; cooperative wireless transmission systems; energy allocation; energy efficient relaying games; fading channels; intermediate nodes; noncooperative game theoretic approach; nonfading channels; two-source relaying game; wireless networks; Computer networks; Energy consumption; Energy efficiency; Fading; Game theory; Nash equilibrium; Power engineering and energy; Protocols; Relays; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    978-1-4244-2109-1
  • Electronic_ISBN
    1058-6393
  • Type

    conf

  • DOI
    10.1109/ACSSC.2007.4487334
  • Filename
    4487334