Communications and Networking. 11th EAI International Conference, ChinaCom 2016, Chongqing, China, September 24-26, 2016, Proceedings, Part I

Research Article

Utility-Based Resource Allocation in OFDMA Relay Systems with Half-Duplex Transmission

Download
176 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-66625-9_27,
        author={Huanglong Teng and Binjie Hu and Hongming Yu and Miao Cui and Guangchi Zhang},
        title={Utility-Based Resource Allocation in OFDMA Relay Systems with Half-Duplex Transmission},
        proceedings={Communications and Networking. 11th EAI International Conference, ChinaCom 2016, Chongqing, China, September 24-26, 2016, Proceedings, Part I},
        proceedings_a={CHINACOM},
        year={2017},
        month={10},
        keywords={Resource allocation Relay transmission OFDMA Utility function Half-duplex},
        doi={10.1007/978-3-319-66625-9_27}
    }
    
  • Huanglong Teng
    Binjie Hu
    Hongming Yu
    Miao Cui
    Guangchi Zhang
    Year: 2017
    Utility-Based Resource Allocation in OFDMA Relay Systems with Half-Duplex Transmission
    CHINACOM
    Springer
    DOI: 10.1007/978-3-319-66625-9_27
Huanglong Teng1, Binjie Hu2, Hongming Yu1, Miao Cui,*, Guangchi Zhang3
  • 1: China Electronics Technology Group Corporation No. 7 Research Institute
  • 2: South China University of Technology
  • 3: Guangdong University of Technology
*Contact email: single450@163.com

Abstract

This paper considers resource allocation in an Orthogonal Frequency Division Multiple Access (OFDMA) relay system, which uses either direct transmission or nonregenerative relay transmission strategies in each subchannel. An optimization problem is developed to handle joint dynamic subchannel assignment (DSA), adaptive power allocation (APA), transmission strategy selection and relay selection in the downlink of OFDMA relay system exploiting half-duplex transmission. We aim to obtain the fair usage of the relays with the assumption that one relay’s maximum subchannels and the relay power in each subchannel are fixed. A suboptimal greedy algorithm is proposed to optimize all users’ overall sum utility, where resources are allocated to the user with the greatest utility increment potential one at a time. Simulation results illustrate that the proposed algorithm significantly outperforms the fixed resource allocation schemes.