TY - GEN
T1 - Joint GSVD-SVD precoding and power allocation for security of AF MIMO relay networks
AU - Wang, Hui Ming
AU - Liu, Feng
AU - Mu, Pengcheng
PY - 2014
Y1 - 2014
N2 - In this paper, we investigate the security issue of a two-hop amplify-and-forward MIMO wireless relay networks in the existence of a multi-antenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a non-convex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate, we propose a suboptimal joint source and relay linear precoding scheme. In the scheme, the source node adopt a generalized singular value decomposition (GSVD) based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on SVD in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate. An alternating iterative optimization algorithm is proposed to solve the problem. The algorithm is computationally efficient and guarantees to converge to a local optimum. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.
AB - In this paper, we investigate the security issue of a two-hop amplify-and-forward MIMO wireless relay networks in the existence of a multi-antenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a non-convex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate, we propose a suboptimal joint source and relay linear precoding scheme. In the scheme, the source node adopt a generalized singular value decomposition (GSVD) based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on SVD in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate. An alternating iterative optimization algorithm is proposed to solve the problem. The algorithm is computationally efficient and guarantees to converge to a local optimum. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.
UR - https://www.scopus.com/pages/publications/84906991688
U2 - 10.1109/ICC.2014.6884127
DO - 10.1109/ICC.2014.6884127
M3 - 会议稿件
AN - SCOPUS:84906991688
SN - 9781479920037
T3 - 2014 IEEE International Conference on Communications, ICC 2014
SP - 5083
EP - 5088
BT - 2014 IEEE International Conference on Communications, ICC 2014
PB - IEEE Computer Society
T2 - 2014 1st IEEE International Conference on Communications, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -