PROJECT TITLE :

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer

ABSTRACT:

During this paper, we study totally different secrecy rate optimization techniques for a multiple-input–multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to boost secret communication within the presence of a multiantenna eavesdropper. Specifically, we contemplate 2 optimization issues, particularly, power minimization and secrecy rate maximization. These problems aren't jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and also the cooperative jammer. To circumvent these nonconvexity problems, we alternatively design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. For a given transmit covariance matrix at the cooperative jammer, we tend to solve the ability minimization and secrecy rate maximization problems primarily based on a Taylor series expansion. Then, we have a tendency to propose two iterative algorithms to unravel these approximated issues. Further, we tend to develop a sturdy scheme by incorporating channel uncertainties related to the eavesdropper. By exploiting S-Procedure, we tend to show that these sturdy optimization issues can be formulated into semidefinite programming. Moreover, we tend to consider the secrecy rate maximization problem primarily based on game theory, where the jammer introduces charges for its jamming service based mostly on the number of the interference caused to the eavesdropper. This secrecy rate maximization drawback is formulated into a Stackelberg game where the jammer and also the transmitter are the leader and also the follower of the game, respectively. For the proposed game, Stackelberg equilibrium is analytically derived. Simulation results are provided to validate the convergence and performance of the proposed algorithms. Similarly, it is shown that the proposed sturdy scheme outperforms the nonrobust scheme in terms of the achieved secrecy rate and the worst-case secrecy rate. Finally, the Stackelberg equilibrium solution has been validated through numerical results.