Secrecy Performance of the MIMO VLC Wiretap Channel With Randomly Located Eavesdropper

被引:16
|
作者
Arfaoui, Mohamed Amine [1 ]
Ghrayeb, Ali [2 ]
Assi, Chadi M. [1 ]
机构
[1] Concordia Univ, CIISE, Montreal, PQ H3G 1M8, Canada
[2] TAMUQ, Elect & Comp Engn ECN Dept, Doha, Qatar
关键词
MIMO communication; Receivers; Precoding; Radio frequency; Light emitting diodes; MISO communication; Security; Achievable secrecy rate; discrete distributions; GSVD-decomposition; MIMO; stochastic geometry; TDGN; VLC; VISIBLE-LIGHT COMMUNICATIONS; PHYSICAL-LAYER SECURITY; COMMUNICATION-SYSTEMS; BROADCAST CHANNELS; SYMMETRIC-MATRICES; SUM-RATE; CAPACITY; TRANSMISSION;
D O I
10.1109/TWC.2019.2944144
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We study in this paper the secrecy performance of the multiple-input multiple-output (MIMO) visible light communication (VLC) wiretap channel. The underlying system model comprises three nodes: one transmitter, equipped with multiple fixtures of LEDs, one legitimate receiver and one eavesdropper, each equipped with multiple photo-diodes (PDs). The VLC channel is modeled as a real-valued amplitude-constrained Gaussian channel and the eavesdropper is assumed to be randomly located in the coverage area. We propose a low-complexity precoding scheme that aims at enhancing the secrecy performance of the system. Specifically, assuming discrete input signaling, we derive an average achievable secrecy rate for the underlying system in a closed-form, and the derived expression is a function of the precoding matrix and the input distribution using stochastic geometry. Then, we propose a low-complexity design of the precoding matrix based on the generalized singular value decomposition (GSVD) of the channel matrices of the system. We examine the resulting average achievable secrecy rate using the truncated discrete generalized normal (TDGN) distribution, which is the best-known discrete distribution available in the literature. Finally, we validate the proposed scheme through extensive simulations and we demonstrate its superiority when compared to other schemes reported in the literature.
引用
收藏
页码:265 / 278
页数:14
相关论文
共 50 条
  • [41] Imperfect Secrecy in Wiretap Channel II
    Cheng, Fan
    Yeung, Raymond W.
    Shum, Kenneth W.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (01) : 628 - 636
  • [42] Enhancing secrecy rates in a wiretap channel
    Shah, Shahid M.
    Sharma, Vinod
    DIGITAL COMMUNICATIONS AND NETWORKS, 2020, 6 (01) : 129 - 135
  • [43] Enhancing secrecy rates in a wiretap channel
    Shahid M.Shah
    Vinod Sharma
    Digital Communications and Networks, 2020, 6 (01) : 129 - 135
  • [44] Imperfect Secrecy in Wiretap Channel II
    Cheng, Fan
    Yeung, Raymond W.
    Shum, Kenneth W.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 71 - 75
  • [45] Comparison of the Secrecy Rates of Two Suboptimal Transmission Methods for the Fading MIMO Wiretap Channel
    Angelova, Sanja
    Kafedziski, Venceslav
    2014 22ND TELECOMMUNICATIONS FORUM TELFOR (TELFOR), 2014, : 222 - 225
  • [46] Secrecy Performance of MIMO Wiretap Channels with Nakagami-m Antenna Correlation
    Sun, Gangcan
    Han, Zhuo
    Liu, Mengge
    2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 117 - 122
  • [47] A Lower Bound on Secrecy Capacity for MIMO Wiretap Channel Aided by a Cooperative Jammer With Channel Estimation Error
    Iwata, Shunya
    Ohtsuki, Tomoaki
    Kam, Pooi-Yuen
    IEEE ACCESS, 2017, 5 : 4636 - 4645
  • [48] The Gaussian Interference Wiretap Channel When the Eavesdropper Channel is Arbitrarily Varying
    He, Xiang
    Yener, Aylin
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [49] Cooperative secrecy: The relay-eavesdropper channel
    Lai, Lifeng
    El Gamal, Hesham
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 931 - 935
  • [50] The relay-eavesdropper channel: Cooperation for secrecy
    Lai, Lifeng
    El Gamal, Hesham
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) : 4005 - 4019