TY - JOUR
T1 - Power Allocation Strategies for Fixed-Gain Half-Duplex Amplify-and-Forward Relaying in Nakagami-m Fading
AU - Zafar, Ammar
AU - Radaydeh, Redha M.
AU - Chen, Yunfei
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2021-02-23
Acknowledgements: This work was funded by King Abdulaziz City of Science and Technology (KACST).
PY - 2014/1
Y1 - 2014/1
N2 - In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) maximizing the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total power consumption while maintaining the end-to-end SNR over a threshold value. We investigate these two problems for two relaying protocols of all-participate (AP) relaying and selective relaying and two cases of feedback to the relays, namely full and limited. We show that the SNR maximization problem is concave and that the power minimization problem is convex for all protocols and feedback cases considered. We obtain closed-form expressions for the two problems in the case of full feedback and solve the problems through convex programming for limited feedback. Numerical results show the benefit of having full feedback at the relays for both optimization problems. However, they also show that feedback overhead can be reduced by having only limited feedback to the relays with only a small degradation in performance.
AB - In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) maximizing the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total power consumption while maintaining the end-to-end SNR over a threshold value. We investigate these two problems for two relaying protocols of all-participate (AP) relaying and selective relaying and two cases of feedback to the relays, namely full and limited. We show that the SNR maximization problem is concave and that the power minimization problem is convex for all protocols and feedback cases considered. We obtain closed-form expressions for the two problems in the case of full feedback and solve the problems through convex programming for limited feedback. Numerical results show the benefit of having full feedback at the relays for both optimization problems. However, they also show that feedback overhead can be reduced by having only limited feedback to the relays with only a small degradation in performance.
UR - http://hdl.handle.net/10754/300621
UR - https://ieeexplore.ieee.org/document/6678680/
UR - http://www.scopus.com/inward/record.url?scp=84893756467&partnerID=8YFLogxK
U2 - 10.1109/TWC.2013.120113.121944
DO - 10.1109/TWC.2013.120113.121944
M3 - Article
AN - SCOPUS:84893756467
VL - 13
SP - 159
EP - 173
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
SN - 1536-1276
IS - 1
ER -