Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Wireless Communications

Secrecy Performance of Multi-User MISO VLC Broadcast Channels With Confidential Messages

Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi M. Assi

Published Sep 26, 2018• 57 citations
Publisher

Abstract

We study, in this paper, the secrecy performance of a multi-user (MU) multiple-input single-output visible light communication broadcast channel with confidential messages. The underlying system model comprises K +1 nodes: a transmitter (Alice) equipped with N fixtures of LEDs and K spatially dispersed users, each equipped with a single photo-diode. The MU channel is modeled as deterministic and real-valued and assumed to be perfectly known to Alice, since all users are assumed to be active. We consider typical secrecy performance measures, namely, the max-min fairness, the harmonic mean, the proportional fairness, and the weighted fairness. For each performance measure, we derive an achievable secrecy rate for the system as a function of the precoding matrix. As such, we propose algorithms that yield the best precoding matrix for the derived secrecy rates, where we analyze their convergence and computational complexity. In contrast, what has been considered in the literature so far is zero-forcing (ZF) precoding, which is suboptimal. We present several numerical examples through which we demonstrate the substantial improvements in the secrecy performance achieved by the proposed techniques compared with those achieved by the conventional ZF. However, this comes at a slight increase in the complexity of the proposed techniques compared with ZF.

DOI
10.1109/twc.2018.2871055

Related papers

Achievable Secrecy Sum-Rate of the MISO VLC Broadcast Channel with Confidential Messages

Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi M. Assi

We investigate in this paper the achievable secrecy sum-rate of the multiple-input single-output (MISO) visible light communication (VLC) broadcast Gaussian channel with confidential messages. We consider a system model comprising (K +1) nodes: a transmitter (Alice) equipped with N fixtures of LEDs and K (K ≤ N) spatially dispersed users, each equipped with a single photo-diode (PD). The channel is modeled as deterministic and real-valued, subject to amplitude and power constraints, through which Alice wants to transmit in one channel use K confidential messages. We propose a new precoding scheme based on the eigenvalues of the pencils of the different K MISO VLC channels in order to maximize the achievable secrecy sum-rate of the overall system. The motivation behind this scheme is based on the fact that the optimal precoding scheme maximizing the achievable secrecy rate of the single user MISO VLC wiretap channel is expressed through the eigenvector associated to the largest eigenvalue of the wiretap channel's pencil. We investigate both cases, namely, when the locations of users are known, i.e., perfect channel state information (CSI) is available to Alice, or unknown, i.e., imperfect CSI. Furthermore, we adopt the truncated generalized normal (TGN) distribution as input signaling. We present several examples which demonstrate the substantial improvements in the secrecy sum-rates achieved by the proposed techniques compared to those achieved by zero-forcing (ZF) precoding.

Globecom•Dec 1, 2017•11 citations

On the secrecy sum-rate of MU-VLC broadcast systems with confidential messages

Thanh V. Pham, Anh T. Pham

This paper studies the secrecy sum-rate in multi-user multiple-input single-output (MU-MISO) broadcast visible light communication (VLC) systems with confidential messages. The well-known Zero-Forcing (ZF) precoding is utilized to ensure confidentiality among users. Different from radio frequency (RF) counterpart, input data signals of VLC systems are amplitude constrained. This fundamental difference makes the derivation of the secrecy capacity more complex. In this study, we investigate a lower bound on the secrecy sum-rate of all users, which is valid in high signal-to-noise ratio (SNR) regime. The secrecy sum-rate is derived for two scenarios: known and unknown eavesdropper's channel state information (CSI) at the transmitter.

International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)•Jul 1, 2016•24 citations

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

Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi M. Assi

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.

IEEE Transactions on Wireless Communications•Oct 4, 2019•28 citations

Enhancing the Secrecy Performance of Gaussian MISO VLC Wiretap Channels with Randomly Located Eavesdroppers

Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi M. Assi

We study in this paper the achievable secrecy rate of the Gaussian multiple-input single-output (MISO) visible light communication (VLC) in the presence of randomly located eavesdroppers. We consider a system model comprising a transmitter (Alice) equipped with multiple fixtures of LEDs, one legitimate receiver (Bob) equipped with a single photo-diode (PD) and a group of randomly located eavesdroppers, each equipped with a single PD. The channel is modeled as deterministic, real- valued and subject to an amplitude constraint, through which Alice wants to communicate privately with Bob. We consider the case where the eavesdroppers are colluding together, i.e., they act jointly in eavesdropping on the communication between Alice and Bob. We adopt the truncated generalized normal (TGN) as input signaling and beamforming as transmission strategy. At first, we derive a closed-form expression of the average achievable secrecy rate as a function of the density of eavesdroppers using stochastic geometry. Then, we investigate the optimal beamformer that maximizes the average achievable secrecy rate of the system. Finally, the analysis is verified by Monte Carlo simulations.

International Conference on Communications•May 1, 2018•4 citations

On the Secrecy Capacity of MISO Visible Light Communication Channels

Mohamed Amine Arfaoui, Zouheir Rezki, Ali Ghrayeb +1 more

We study the secrecy capacity of the multiple- input single-output (MISO) Gaussian wiretap visible light communication (VLC) channel. We study a typical VLC scenario with one transmitter, one legitimate receiver, and one eavesdropper. Specifically, we compute the achievable secrecy rate for various input signaling distributions, including the truncated generalized normal (TGN) and uniform distributions. The transmitter is equipped with multiple light sources, while the legitimate and unauthorized receivers are each equipped with a single photodetector. We analyze the achievable secrecy rates via transmit beamforming and artificial noise. In addition, both zero-forcing beamforming and robust beamforming are considered. In the former case, the location of the eavesdropper is assumed to be known, whereas in the latter case, the location of the eavesdropper is unknown. Our numerical results show that the secrecy rate achieved by the TGN distribution is significantly improved as compared to those achieved by the truncated Gaussian and uniform distributions, for both zero-forcing beamforming and robust beamforming. We also derive an upper bound on the achievable secrecy capacity that we used to assess the closeness of the achievable secrecy rates to the derived bound.

Globecom•Dec 1, 2016•59 citations

Discrete Input Signaling for Secure MISO VLC Systems with Randomly Located Eavesdroppers

Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi M. Assi +1 more

We study in this paper the secrecy performance of the multiple-input single-output (MISO) visible light communication (VLC) channel in the presence of randomly located eavesdroppers. We consider a system model comprising a transmitter, equipped with multiple fixtures of LEDs, one legitimate receiver equipped with a single photo-diode (PD) and a group of randomly located (and colluding) eavesdroppers, each equipped with a single PD. We derive a closed-form expression for the average achievable secrecy rate as a function of the beamforming vector, the input distribution, and the location density of the eavesdroppers using stochastic geometry. We then investigate the optimal beamformer that maximizes the average achievable secrecy rate. We corroborate the analytical results through Monte Carlo simulations and we demonstrate substantial improvements provided by the proposed scheme over existing ones.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2018•3 citations
We study, in this paper, the secrecy performance of a multi-user (MU) multiple-input single-output visible light communication broadcast channel with confidential messages. The underlying system model comprises K +1 nodes: a transmitter (Alice) equipped with N fixtures of LEDs and K spatially dispersed users, each equipped with a single photo-diode. The MU channel is modeled as deterministic and real-valued and assumed to be perfectly known to Alice, since all users are assumed to be active. We consider typical secrecy performance measures, namely, the max-min fairness, the harmonic mean, the proportional fairness, and the weighted fairness. For each performance measure, we derive an achievable secrecy rate for the system as a function of the precoding matrix. As such, we propose algorithms that yield the best precoding matrix for the derived secrecy rates, where we analyze their convergence and computational complexity. In contrast, what has been considered in the literature so far is zero-forcing (ZF) precoding, which is suboptimal. We present several numerical examples through which we demonstrate the substantial improvements in the secrecy performance achieved by the proposed techniques compared with those achieved by the conventional ZF. However, this comes at a slight increase in the complexity of the proposed techniques compared with ZF.
We investigate in this paper the achievable secrecy sum-rate of the multiple-input single-output (MISO) visible light communication (VLC) broadcast Gaussian channel with confidential messages. We consider a system model comprising (K +1) nodes: a transmitter (Alice) equipped with N fixtures of LEDs and K (K ≤ N) spatially dispersed users, each equipped with a single photo-diode (PD). The channel is modeled as deterministic and real-valued, subject to amplitude and power constraints, through which Alice wants to transmit in one channel use K confidential messages. We propose a new precoding scheme based on the eigenvalues of the pencils of the different K MISO VLC channels in order to maximize the achievable secrecy sum-rate of the overall system. The motivation behind this scheme is based on the fact that the optimal precoding scheme maximizing the achievable secrecy rate of the single user MISO VLC wiretap channel is expressed through the eigenvector associated to the largest eigenvalue of the wiretap channel's pencil. We investigate both cases, namely, when the locations of users are known, i.e., perfect channel state information (CSI) is available to Alice, or unknown, i.e., imperfect CSI. Furthermore, we adopt the truncated generalized normal (TGN) distribution as input signaling. We present several examples which demonstrate the substantial improvements in the secrecy sum-rates achieved by the proposed techniques compared to those achieved by zero-forcing (ZF) precoding.
This paper studies the secrecy sum-rate in multi-user multiple-input single-output (MU-MISO) broadcast visible light communication (VLC) systems with confidential messages. The well-known Zero-Forcing (ZF) precoding is utilized to ensure confidentiality among users. Different from radio frequency (RF) counterpart, input data signals of VLC systems are amplitude constrained. This fundamental difference makes the derivation of the secrecy capacity more complex. In this study, we investigate a lower bound on the secrecy sum-rate of all users, which is valid in high signal-to-noise ratio (SNR) regime. The secrecy sum-rate is derived for two scenarios: known and unknown eavesdropper's channel state information (CSI) at the transmitter.
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.
We study in this paper the achievable secrecy rate of the Gaussian multiple-input single-output (MISO) visible light communication (VLC) in the presence of randomly located eavesdroppers. We consider a system model comprising a transmitter (Alice) equipped with multiple fixtures of LEDs, one legitimate receiver (Bob) equipped with a single photo-diode (PD) and a group of randomly located eavesdroppers, each equipped with a single PD. The channel is modeled as deterministic, real- valued and subject to an amplitude constraint, through which Alice wants to communicate privately with Bob. We consider the case where the eavesdroppers are colluding together, i.e., they act jointly in eavesdropping on the communication between Alice and Bob. We adopt the truncated generalized normal (TGN) as input signaling and beamforming as transmission strategy. At first, we derive a closed-form expression of the average achievable secrecy rate as a function of the density of eavesdroppers using stochastic geometry. Then, we investigate the optimal beamformer that maximizes the average achievable secrecy rate of the system. Finally, the analysis is verified by Monte Carlo simulations.
We study the secrecy capacity of the multiple- input single-output (MISO) Gaussian wiretap visible light communication (VLC) channel. We study a typical VLC scenario with one transmitter, one legitimate receiver, and one eavesdropper. Specifically, we compute the achievable secrecy rate for various input signaling distributions, including the truncated generalized normal (TGN) and uniform distributions. The transmitter is equipped with multiple light sources, while the legitimate and unauthorized receivers are each equipped with a single photodetector. We analyze the achievable secrecy rates via transmit beamforming and artificial noise. In addition, both zero-forcing beamforming and robust beamforming are considered. In the former case, the location of the eavesdropper is assumed to be known, whereas in the latter case, the location of the eavesdropper is unknown. Our numerical results show that the secrecy rate achieved by the TGN distribution is significantly improved as compared to those achieved by the truncated Gaussian and uniform distributions, for both zero-forcing beamforming and robust beamforming. We also derive an upper bound on the achievable secrecy capacity that we used to assess the closeness of the achievable secrecy rates to the derived bound.
We study in this paper the secrecy performance of the multiple-input single-output (MISO) visible light communication (VLC) channel in the presence of randomly located eavesdroppers. We consider a system model comprising a transmitter, equipped with multiple fixtures of LEDs, one legitimate receiver equipped with a single photo-diode (PD) and a group of randomly located (and colluding) eavesdroppers, each equipped with a single PD. We derive a closed-form expression for the average achievable secrecy rate as a function of the beamforming vector, the input distribution, and the location density of the eavesdroppers using stochastic geometry. We then investigate the optimal beamformer that maximizes the average achievable secrecy rate. We corroborate the analytical results through Monte Carlo simulations and we demonstrate substantial improvements provided by the proposed scheme over existing ones.