TY - GEN
T1 - Price-based friendly jamming in a MISO interference wiretap channel
AU - Siyari, Peyman
AU - Krunz, Marwan
AU - Nguyen, Diep N.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/27
Y1 - 2016/7/27
N2 - In this paper, we expand the scope of PHY-layer security by investigating TX-based friendly jamming (FJ) for the wiretap channel in multi-link settings. For the single-link scenario, creating a TX-based FJ is an effective and practical method in improving the secrecy rate. In a multi-link setting, several information signals must be transmitted simultaneously. Thus, the design must guarantee that the FJ signal of a given transmitter does not interfere with unintended but legitimate receivers. Under the assumption of exact knowledge of the eavesdropping channel, we first propose a distributed price-based approach to improve the secrecy sum-rate of a two-link network with one eavesdropper while satisfying an information-rate constraint for both link. Simulations show that price-based FJ control outperforms greedy FJ, and is close to the performance of a centralized approach. Next, we propose a method based on mixed strategic games that can offer robust solutions to the distributed secrecy sum-rate maximization problem under the assumption of an unknown eavesdropping channel. Lastly, we use simulations to show that in addition to outperforming the greedy approach, our robust optimization also satisfies practical network considerations. In particular, the transmission time for the robust optimization can be determined flexibly to match the channel's coherence time.
AB - In this paper, we expand the scope of PHY-layer security by investigating TX-based friendly jamming (FJ) for the wiretap channel in multi-link settings. For the single-link scenario, creating a TX-based FJ is an effective and practical method in improving the secrecy rate. In a multi-link setting, several information signals must be transmitted simultaneously. Thus, the design must guarantee that the FJ signal of a given transmitter does not interfere with unintended but legitimate receivers. Under the assumption of exact knowledge of the eavesdropping channel, we first propose a distributed price-based approach to improve the secrecy sum-rate of a two-link network with one eavesdropper while satisfying an information-rate constraint for both link. Simulations show that price-based FJ control outperforms greedy FJ, and is close to the performance of a centralized approach. Next, we propose a method based on mixed strategic games that can offer robust solutions to the distributed secrecy sum-rate maximization problem under the assumption of an unknown eavesdropping channel. Lastly, we use simulations to show that in addition to outperforming the greedy approach, our robust optimization also satisfies practical network considerations. In particular, the transmission time for the robust optimization can be determined flexibly to match the channel's coherence time.
KW - Friendly jamming
KW - Interference wiretap channel
KW - Pricing
KW - Pure and mixed strategic games
UR - http://www.scopus.com/inward/record.url?scp=84983233333&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84983233333&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2016.7524447
DO - 10.1109/INFOCOM.2016.7524447
M3 - Conference contribution
AN - SCOPUS:84983233333
T3 - Proceedings - IEEE INFOCOM
BT - IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016
Y2 - 10 April 2016 through 14 April 2016
ER -