• DocumentCode
    2294733
  • Title

    Resource allocation for the AF Multiple Access Relay Channel with OFDMA

  • Author

    Schedler, Stephan ; Angierski, Andre ; Kuehn, Volker

  • Author_Institution
    Inst. of Commun. Eng., Univ. of Rostock, Rostock, Germany
  • fYear
    2012
  • fDate
    1-4 April 2012
  • Firstpage
    486
  • Lastpage
    491
  • Abstract
    This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.
  • Keywords
    OFDM modulation; amplify and forward communication; communication complexity; frequency division multiple access; gradient methods; resource allocation; wireless channels; AF multiple access relay channel; MARC; NP-hard; OFDMA; amplify-and-forward relaying; carrier allocation; gradient method; near-optimum algorithm; numerical simulation; resource allocation; subcarrier; sum rate; transmission scheme; transmit power allocation; Algorithm design and analysis; Complexity theory; Joints; OFDM; Optimization; Relays; Resource management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2012 IEEE
  • Conference_Location
    Shanghai
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4673-0436-8
  • Type

    conf

  • DOI
    10.1109/WCNC.2012.6214415
  • Filename
    6214415