Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer
Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer
复制标题
DOI：
10.1109/tvt.2014.2336092
复制
发表时间：
2015-05-01
影响因子：
6.8
通讯作者：
Le Goff, Stephane Y.
中科院分区：
文献类型：
--
作者：
Chu, Zheng;Cumanan, Kanapathippillai;Le Goff, Stephane Y.
在本文中，我们研究了不同的保密率优化技术的多输入多输出（MIMO）保密信道，其中多天线合作干扰机，以提高秘密通信中存在的多天线窃听。具体来说，我们考虑两个优化问题，即功率最小化和保密率最大化。这些问题不是联合凸的合法发射机和合作干扰机的发射协方差矩阵。为了规避这些非凸性问题，我们交替设计合法发射机和合作干扰机的发射协方差矩阵。对于给定的协同干扰机发射协方差矩阵，我们解决了基于泰勒级数展开的功率最小化和保密率最大化问题。然后，我们提出了两个迭代算法来解决这些近似问题。此外，我们开发了一个强大的计划，将信道的不确定性与窃听。利用S-过程，我们证明了这些鲁棒优化问题可以转化为半定规划。此外，我们考虑的保密率最大化问题的博弈论的基础上，干扰机引入收费的干扰服务的基础上所造成的窃听量。这个保密率最大化的问题制定成一个Stackelberg游戏的干扰机和发射机的领导者和追随者的游戏，分别。对于建议的游戏，Stackelberg均衡解析推导。仿真结果验证了算法的收敛性和性能。此外，它表明，所提出的鲁棒方案优于非鲁棒方案在实现的保密率和最坏情况下的保密率。最后，数值结果验证了Stackelberg平衡解的正确性.
In this paper, we study different secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to improve secret communication in the presence of a multiantenna eavesdropper. Specifically, we consider two optimization problems, namely, power minimization and secrecy rate maximization. These problems are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To circumvent these nonconvexity issues, 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 solve the power minimization and secrecy rate maximization problems based on a Taylor series expansion. Then, we propose two iterative algorithms to solve these approximated problems. In addition, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploiting S-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming. Moreover, we consider the secrecy rate maximization problem based on game theory, where the jammer introduces charges for its jamming service based on the amount of the interference caused to the eavesdropper. This secrecy rate maximization problem is formulated into a Stackelberg game where the jammer and the transmitter are the leader and the follower of the game, respectively. For the proposed game, Stackelberg equilibrium is analytically derived. Simulation results have been provided to validate the convergence and performance of the proposed algorithms. In addition, it is shown that the proposed robust 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.