Precoder design for secrecy rate maximization in the DF-based MIMO relay networks

Abstract

In this paper, we study the precoder design problem for secrecy rate maximization in a decode-and-forward (DF)-based multiple-input multiple-output (MIMO) relay network. The system model considered here consists of a source, a trusted relay, a legitimate receiver and an eavesdropper, all mounted with multiple antennas. Our objective is to maximize the achievable secrecy rate of this DF-based MIMO relay wiretap system subject to a total transmit power constraint. Since the formulated secrecy rate maximization (SRM) problem is nonconvex in general, we solve it by employing a successive convex approximation (SCA) method. With the SCA method, the nonconvex part of the formulated problem is linearized to its first-order Taylor expansion. Then, the nonconvex SRM problem can be iteratively solved through successive convex programming of its convexified version, and thus an iterative precoding algorithm is developed. Moreover, the theoretical result is further extended to the case when multiple eavesdroppers are simultaneously present. Finally, numerical simulations are provided to evaluate the performance of the proposed algorithm. Results show that our algorithm can converge fast to a near-optimal solution.