A game theoretic design of artificial-noise aided transmissions in MIMO wiretap interference network

Siyari, P; Krunz, M; Nguyen, DN

A game theoretic design of artificial-noise aided transmissions in MIMO wiretap interference network

Siyari, P Krunz, M Nguyen, DN

Permalink

Publication Type:: Conference Proceeding
Citation:: 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, 2016
Issue Date:: 2016-01-01

Closed Access

	Filename	Description	Size
	07841504.pdf	Published version	242.14 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Siyari, P	en_US
dc.contributor.author	Krunz, M	en_US
dc.contributor.author	Nguyen, DN https://orcid.org/0000-0003-2659-8648	en_US
dc.date.issued	2016-01-01	en_US
dc.identifier.citation	2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, 2016	en_US
dc.identifier.isbn	9781509013289	en_US
dc.identifier.uri	http://hdl.handle.net/10453/91506
dc.description.abstract	© 2016 IEEE. 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.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DE150101092
dc.relation.ispartof	2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2016.7841504	en_US
dc.title	A game theoretic design of artificial-noise aided transmissions in MIMO wiretap interference network	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 2016 IEEE. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/91506