A low complexity resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed

• Main Authors: Salah, Asem A., Raja Abdullah, Raja Syamsul Azmir, Mohd Ali, Borhanuddin, Odeh, Nidhal A.
• Format: Article
• Language: English
• Published: The Institute of Electronics Information and Communication Engineers 2011
• Online Access: http://psasir.upm.edu.my/id/eprint/23166/1/A%20low%20complexity%20resource%20allocation%20algorithm%20for%20OFDMA%20cooperative%20relay%20networks%20with%20fairness%20and%20QoS%20guaranteed.pdf; http://psasir.upm.edu.my/id/eprint/23166/; https://www.jstage.jst.go.jp/article/transcom/E94.B/8/E94.B_8_2328/_article
• Institution: Universiti Putra Malaysia

This paper proposes a new resource allocation algorithm for uplink OFDMA-based cooperative relay networks, assuming multiple user nodes, multiple relay nodes and a single destination. The aim is to maximise the total sum of the users' data rates, while guaranteeing fairness among them with different QoS requirements. Assuming perfect channel state information (CSI) at the resource allocation controller, the optimisation problem is formulated such that each user is assigned a weight factor based on its QoS requirements. The ones with higher weights are given higher priorities to select their resources (relay stations and subcarriers) first. Once the required QoS is achieved for all users, the weight factor for all users is reduced to a small uniform value. The remaining resources are then allocated to the users with higher instantaneous rates in order of magnitude. The results show that the proposed algorithm outperforms the greedy and static algorithms in terms of outage probability and fairness, and at the same time outperforms Jeong's algorithm by 58% in terms of total sum rate, with an average 74% reduction in system complexity.