TY - JOUR
T1 - Distributed Power Control in Single-Stream MIMO Wiretap Interference Networks With Full-Duplex Jamming Receivers
AU - Siyari, Peyman
AU - Krunz, Marwan
AU - Nguyen, Diep N.
N1 - Funding Information:
Manuscript received March 22, 2018; revised August 31, 2018 and November 12, 2018; accepted November 14, 2018. Date of publication November 23, 2018; date of current version December 18, 2018. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Laura Cottatellucci. This work was supported in part by the NSF under Grants CNS-1409172, CNS-1513649, CNS-1731164, and IIP-1822071, in part by Australian Defense Science and Technology Group, in part by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant number 102.04-2016.23, and in part by the Qatar Foundation under Grant NPRP 8-052-2-029. Any opinions, findings, conclusions, or recommendations expressed in this paper are those of the author(s) and do not necessarily reflect the views of the NSF, and QF. This paper was presented in part at the IEEE International Conference Communication 2017, Workshop on Full-duplex Communications for Future Wireless Networks, May 2017. (Corresponding author: Peyman Siyari.) P. Siyari is with the Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721 USA (e-mail:, psiyari@email. arizona.edu).
Publisher Copyright:
© 2018 IEEE.
PY - 2019/2/1
Y1 - 2019/2/1
N2 - We consider a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each link seeks to maximize its secrecy rate by determining the best power assignment (PA) for the information, TxFJ, and RxFJ signals. Joint optimization of these parameters is a non-convex problem. Hence, we seek sub-optimal solutions. Specifically, we find a lower bound on the allocated power to TxFJ above which positive secrecy is achievable for a given link. Once positive secrecy is achieved, the secrecy rate becomes monotonically increasing in the power at the transmitter (Alice). Therefore, the rest of Alice's power is allocated to the information signal. Despite its sub-optimality, such an approach precludes the possibility of employing successive interference cancellation by the eavesdropper. The RxFJ PA of a link is adjusted using an on-off PA that depends only on the link's local channel state information (CSI). With every link following such a strategy, we model this interaction as a non-cooperative game. We derive sufficient conditions for the uniqueness of the resulting Nash equilibrium. We then propose an algorithm to implement the PA game. Lastly, we relax knowledge of eavesdropper's CSI (E-CSI) and propose a framework that is robust to unknown E-CSI. Our results indicate that this robust framework performs close to when E-CSI is fully known to legitimate links. Moreover, empirically it is shown that the secrecy sum-rate scales with the power budget of transmitters.
AB - We consider a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each link seeks to maximize its secrecy rate by determining the best power assignment (PA) for the information, TxFJ, and RxFJ signals. Joint optimization of these parameters is a non-convex problem. Hence, we seek sub-optimal solutions. Specifically, we find a lower bound on the allocated power to TxFJ above which positive secrecy is achievable for a given link. Once positive secrecy is achieved, the secrecy rate becomes monotonically increasing in the power at the transmitter (Alice). Therefore, the rest of Alice's power is allocated to the information signal. Despite its sub-optimality, such an approach precludes the possibility of employing successive interference cancellation by the eavesdropper. The RxFJ PA of a link is adjusted using an on-off PA that depends only on the link's local channel state information (CSI). With every link following such a strategy, we model this interaction as a non-cooperative game. We derive sufficient conditions for the uniqueness of the resulting Nash equilibrium. We then propose an algorithm to implement the PA game. Lastly, we relax knowledge of eavesdropper's CSI (E-CSI) and propose a framework that is robust to unknown E-CSI. Our results indicate that this robust framework performs close to when E-CSI is fully known to legitimate links. Moreover, empirically it is shown that the secrecy sum-rate scales with the power budget of transmitters.
KW - Interference network
KW - distributed design
KW - friendly jamming
KW - full-duplex radios
KW - game theory
UR - http://www.scopus.com/inward/record.url?scp=85057358119&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85057358119&partnerID=8YFLogxK
U2 - 10.1109/TSP.2018.2883008
DO - 10.1109/TSP.2018.2883008
M3 - Article
AN - SCOPUS:85057358119
SN - 1053-587X
VL - 67
SP - 594
EP - 608
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 3
M1 - 8543667
ER -