TY - GEN
T1 - A game theoretic design of artificial-noise aided transmissions in MIMO wiretap interference network
AU - Siyari, Peyman
AU - Krunz, Marwan
AU - Nguyen, Diep N.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
KW - Equilibrium selection
KW - Friendly jamming
KW - MIMO precoders
KW - Wiretap interference network
UR - http://www.scopus.com/inward/record.url?scp=85015434141&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015434141&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2016.7841504
DO - 10.1109/GLOCOM.2016.7841504
M3 - Conference contribution
AN - SCOPUS:85015434141
T3 - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
BT - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 59th IEEE Global Communications Conference, GLOBECOM 2016
Y2 - 4 December 2016 through 8 December 2016
ER -