• DocumentCode
    2204012
  • Title

    Adapative resource allocation for downlink OFDMA networks using cooperative game theory

  • Author

    Zhang, Guopeng ; Zhang, Hailin

  • Author_Institution
    State Key Lab. of Integrated Services Networks, Xidian Univ., Xi´´an, China
  • fYear
    2008
  • fDate
    19-21 Nov. 2008
  • Firstpage
    98
  • Lastpage
    103
  • Abstract
    This paper proposes a cooperative game theoretic resource allocation scheme for downlink OFDMA wireless networks. We define a user¿s payoff as a function of his data throughput. Then the source allocation can be modeled as a cooperative game to maximize the aggregate payoff of the users. To achieve the Nash bargaining solution (NBS) of the game, a suboptimal subcarrier allocation is first performed by assuming an equal power allocation. An optimal power allocation algorithm then maximizes the sum payoff while ensuring QoS demand (the minimum data throughputs) of the users. Through comparing with the other two resource allocation algorithms, i.e., the maximizing system capacity and the max-min fairness algorithm, simulation results show that the cooperative game acquired a good tradeoff between the fairness and the overall system capacity. The user¿s QoS demand is ensured, and the system resource is utilized efficiently.
  • Keywords
    cooperative systems; error statistics; frequency division multiple access; game theory; resource allocation; Nash bargaining solution; adaptive resource allocation; cooperative game theory; downlink OFDMA networks; wireless networks; Bit error rate; Downlink; Frequency conversion; Game theory; Intserv networks; Laboratories; Nonlinear equations; Resource management; Signal to noise ratio; Throughput; Nash bargaining solution; OFDMA; QoS; cooperative game; resource allocation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Systems, 2008. ICCS 2008. 11th IEEE Singapore International Conference on
  • Conference_Location
    Guangzhou
  • Print_ISBN
    978-1-4244-2423-8
  • Electronic_ISBN
    978-1-4244-2424-5
  • Type

    conf

  • DOI
    10.1109/ICCS.2008.4737151
  • Filename
    4737151