TY - GEN
T1 - Relay selection in FDD amplify-and-forward cooperative networks
AU - Gouissem, A.
AU - Samara, L.
AU - Hamila, R.
AU - Al-Dhahir, N.
AU - Foufou, S.
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable sub-optimal multiple relay selection and beamforming optimization scheme based on the l1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming at maximizing the aggregated SNR of the two communicating nodes. Furthermore, by exploiting the previous solutions to accelerate the algorithm's convergence, our proposed algorithm converges to a suboptimal solution compared to the exhaustive search technique with much less complexity.
AB - In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable sub-optimal multiple relay selection and beamforming optimization scheme based on the l1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming at maximizing the aggregated SNR of the two communicating nodes. Furthermore, by exploiting the previous solutions to accelerate the algorithm's convergence, our proposed algorithm converges to a suboptimal solution compared to the exhaustive search technique with much less complexity.
KW - Beamforming
KW - Bi-directional communication
KW - L norm
KW - Optimization
KW - Relaying
KW - Semidefinite relaxation
UR - http://www.scopus.com/inward/record.url?scp=85045239576&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85045239576&partnerID=8YFLogxK
U2 - 10.1109/PIMRC.2017.8292408
DO - 10.1109/PIMRC.2017.8292408
M3 - Conference contribution
AN - SCOPUS:85045239576
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
SP - 1
EP - 7
BT - 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2017
Y2 - 8 October 2017 through 13 October 2017
ER -