TY - JOUR
T1 - Fairness-Aware Energy-Efficient Resource Allocation for AF Co-Operative OFDMA Networks
AU - Bedeer, Ebrahim
AU - Alorainy, Abdulaziz
AU - Hossain, Md. Jahangir
AU - Amin, Osama
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2015/9/23
Y1 - 2015/9/23
N2 - In this paper, we adopt an energy-efficiency (EE) metric, named worst-EE, that is suitable for EE fairness optimization in the uplink transmission of amplify-and-forward (AF) cooperative orthogonal frequency division multiple access (OFDMA) networks. More specifically, we assign subcarriers and allocate powers for mobile and relay stations in order to maximize the worst-EE, i.e., to maximize the EE of the mobile station (MS) with the lowest EE value, subject to MSs transmit power, relay station (RS) transmit power, and MSs quality-of-service (QoS) constraints. The formulated primal max-min optimization problem is nonconvex fractional mixed integer nonlinear program, i.e., NP-hard to solve. We provide a novel optimization framework that studies the structure of the primal problem and prove that the dual min-max optimization problem attains the same optimal solution of the primal problem. Additionally, we propose a modified Dinkelbach algorithm, named dual Dinkelbach, to achieve the optimal solution of the dual problem in a polynomial time complexity. We further exploit the structure of the obtained optimal solution and develop a low complexity suboptimal heuristic. Numerical results show the effectiveness of the proposed algorithm to improve the network performance in terms of fairness between MSs, worst-EE, and average network transmission rate when compared to traditional schemes that maximize the EE of the whole network. Presented results also show that the suboptimal heuristic balances the achieved performance and the computational complexity.
AB - In this paper, we adopt an energy-efficiency (EE) metric, named worst-EE, that is suitable for EE fairness optimization in the uplink transmission of amplify-and-forward (AF) cooperative orthogonal frequency division multiple access (OFDMA) networks. More specifically, we assign subcarriers and allocate powers for mobile and relay stations in order to maximize the worst-EE, i.e., to maximize the EE of the mobile station (MS) with the lowest EE value, subject to MSs transmit power, relay station (RS) transmit power, and MSs quality-of-service (QoS) constraints. The formulated primal max-min optimization problem is nonconvex fractional mixed integer nonlinear program, i.e., NP-hard to solve. We provide a novel optimization framework that studies the structure of the primal problem and prove that the dual min-max optimization problem attains the same optimal solution of the primal problem. Additionally, we propose a modified Dinkelbach algorithm, named dual Dinkelbach, to achieve the optimal solution of the dual problem in a polynomial time complexity. We further exploit the structure of the obtained optimal solution and develop a low complexity suboptimal heuristic. Numerical results show the effectiveness of the proposed algorithm to improve the network performance in terms of fairness between MSs, worst-EE, and average network transmission rate when compared to traditional schemes that maximize the EE of the whole network. Presented results also show that the suboptimal heuristic balances the achieved performance and the computational complexity.
UR - http://hdl.handle.net/10754/595956
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7274317
UR - http://www.scopus.com/inward/record.url?scp=84960193647&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2015.2481207
DO - 10.1109/JSAC.2015.2481207
M3 - Article
SN - 0733-8716
VL - 33
SP - 2478
EP - 2493
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 12
ER -