Distributed Power Control in Single-stream MIMO Wiretap Interference Networks with Full-duplex Jamming Receivers

Peyman Siyari, Marwan M Krunz, Diep N. Nguyen

Research output: Contribution to journalArticle

Abstract

We study secure and distributed power control in a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with both transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each transmitter-receiver (Tx-Rx) pair 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, thus computationally demanding. Hence, we seek sub-optimal solutions that aim to provide positive secrecy for each link. 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 Tx (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 a strong multiuser detector (e.g., successive interference cancellation) by the eavesdropper. The TxFJ PA at a link is done with respect to the observed interference at the corresponding Rx and at Eve, whereas the RxFJ of that 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. Assuming knowledge of eavesdropper's CSI (E-CSI), 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 E-CSI and propose a framework that is robust to unknown E-CSI. Our results indicate that the performance of this robust framework is 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 legitimate transmitters.

Original languageEnglish (US)
JournalIEEE Transactions on Signal Processing
DOIs
StateAccepted/In press - Jan 1 2018

Fingerprint

Jamming
Channel state information
MIMO systems
Power control
Transmitters
Transceivers
Telecommunication links
Detectors

Keywords

  • distributed design
  • friendly jamming
  • fullduplex radios
  • game theory
  • Games
  • Interference cancellation
  • Interference network
  • Jamming
  • Power control
  • Receivers
  • Security

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{790b385989ca4983be52d11724066c32,
title = "Distributed Power Control in Single-stream MIMO Wiretap Interference Networks with Full-duplex Jamming Receivers",
abstract = "We study secure and distributed power control in a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with both transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each transmitter-receiver (Tx-Rx) pair 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, thus computationally demanding. Hence, we seek sub-optimal solutions that aim to provide positive secrecy for each link. 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 Tx (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 a strong multiuser detector (e.g., successive interference cancellation) by the eavesdropper. The TxFJ PA at a link is done with respect to the observed interference at the corresponding Rx and at Eve, whereas the RxFJ of that 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. Assuming knowledge of eavesdropper's CSI (E-CSI), 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 E-CSI and propose a framework that is robust to unknown E-CSI. Our results indicate that the performance of this robust framework is 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 legitimate transmitters.",
keywords = "distributed design, friendly jamming, fullduplex radios, game theory, Games, Interference cancellation, Interference network, Jamming, Power control, Receivers, Security",
author = "Peyman Siyari and Krunz, {Marwan M} and Nguyen, {Diep N.}",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/TSP.2018.2883008",
language = "English (US)",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Distributed Power Control in Single-stream MIMO Wiretap Interference Networks with Full-duplex Jamming Receivers

AU - Siyari, Peyman

AU - Krunz, Marwan M

AU - Nguyen, Diep N.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We study secure and distributed power control in a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with both transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each transmitter-receiver (Tx-Rx) pair 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, thus computationally demanding. Hence, we seek sub-optimal solutions that aim to provide positive secrecy for each link. 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 Tx (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 a strong multiuser detector (e.g., successive interference cancellation) by the eavesdropper. The TxFJ PA at a link is done with respect to the observed interference at the corresponding Rx and at Eve, whereas the RxFJ of that 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. Assuming knowledge of eavesdropper's CSI (E-CSI), 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 E-CSI and propose a framework that is robust to unknown E-CSI. Our results indicate that the performance of this robust framework is 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 legitimate transmitters.

AB - We study secure and distributed power control in a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped with both transmitter-based friendly jamming (TxFJ) and receiver-based friendly jamming (RxFJ). Each transmitter-receiver (Tx-Rx) pair 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, thus computationally demanding. Hence, we seek sub-optimal solutions that aim to provide positive secrecy for each link. 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 Tx (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 a strong multiuser detector (e.g., successive interference cancellation) by the eavesdropper. The TxFJ PA at a link is done with respect to the observed interference at the corresponding Rx and at Eve, whereas the RxFJ of that 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. Assuming knowledge of eavesdropper's CSI (E-CSI), 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 E-CSI and propose a framework that is robust to unknown E-CSI. Our results indicate that the performance of this robust framework is 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 legitimate transmitters.

KW - distributed design

KW - friendly jamming

KW - fullduplex radios

KW - game theory

KW - Games

KW - Interference cancellation

KW - Interference network

KW - Jamming

KW - Power control

KW - Receivers

KW - Security

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

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

ER -