A Game Theoretic Design of Artificial-Noise Aided Transmissions in MIMO Wiretap Interference Network

The article considers the joint optimization of artificial noise (AN) and information signal precoders in a MIMO wiretap interference network where the transmission of each user may be overheard by several MIMO-capable eavesdroppers. We use the theory of non-cooperative games to propose a distributed framework to optimize the covariance matrices of the information signal and AN at each link. To tackle the non-convexity of each link/player's optimization problem, we recruit a relaxed equilibrium concept in game theory, called quasi-Nash equilibrium (QNE). Under the assumption of no coordination between links, we derive sufficient conditions for the existence and uniqueness of the resulting QNE. It turns out that the uniqueness of QNE is not always guaranteed, especially in the case of high interference. Hence, multiple QNEs might exist, and an ordinary updating process (e.g., Gauss-Seidel, Jacobi, or asynchronous update) does not guarantee the convergence to a QNE. Instead, by using the Tikhonov regularization method for variational inequality problems, we modify our algorithm to guarantee the game's convergence to a QNE even in the case of having multiple QNEs. The modified algorithm also allows the links to select between multiple QNEs so as to reduce the received interference at the legitimate receivers. Simulations are then used to confirm the above theoretical findings and the efficacy (in terms of secrecy sum-rate, convergence guarantee, and energy efficiency) of the latter algorithm.