• DocumentCode
    3345127
  • Title

    On QoS-Guaranteed Downlink Cooperative OFDMA Systems with Amplify-and-Forward Relays: Optimal Schedule and Resource Allocation

  • Author

    Zhang, Danhua ; Wang, Youzheng ; Lu, Jianhua

  • Author_Institution
    Dept. of Electron. Eng., Tsinghua Univ., Beijing
  • fYear
    2009
  • fDate
    5-8 April 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    This paper considers joint schedule and resource allocation in downlink cooperative OFDMA systems with multiple sources, multiple relays and a single destination. Each user has individual QoS requirements and the relays operate in amplify-and-forward and half-duplex mode. We try to find optimal power allocation, relay selection and subcarrier assignment to maximize overall system rates. The problem is formulated as a Mixed Binary Integer Programming (MBIP). Although the original problem is comprehensive in nature, a novel two-level dual-primal decomposition based algorithm is proposed to tackle the problem. Optimal solutions are given in closed-form and the algorithm has a polynomial complexity in general. The efficiency of the algorithm is finally illustrated by numerical results.
  • Keywords
    OFDM modulation; computational complexity; cooperative systems; frequency division multiple access; integer programming; quality of service; relays; resource allocation; QoS; amplify-and-forward relay; downlink cooperative OFDMA system; half-duplex mode; mixed binary integer programming; optimal power allocation; optimal schedule; polynomial complexity; relay selection; resource allocation; subcarrier assignment; two-level dual-primal decomposition; Communications Society; Downlink; Land mobile radio cellular systems; Linear programming; Optimal scheduling; Peer to peer computing; Power system relaying; Quality of service; Relays; Resource management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference, 2009. WCNC 2009. IEEE
  • Conference_Location
    Budapest
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4244-2947-9
  • Electronic_ISBN
    1525-3511
  • Type

    conf

  • DOI
    10.1109/WCNC.2009.4917847
  • Filename
    4917847