Journal
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 20, Issue 1, Pages 653-666Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2020.3027674
Keywords
Visible light communication; physical layer security; artificial noise; precoding
Funding
- Telecommunications Advancement Foundation (TAF) [C-2020-2]
Ask authors/readers for more resources
This article focuses on the designs of physical layer security (PLS) in visible light communication systems, specifically looking at how to use artificial noise-aided precoding to address the presence of multiple unauthorized users. Different design approaches are proposed considering unknown and known unauthorized users' channel state information (CSI), and two sub-optimal yet low-complexity methods, Concave-Convex Procedure (CCP) and Semidefinite Relaxation (SDR), are examined to solve the non-convex design problem. Extensive numerical results are presented to demonstrate the feasibility and performance of each design with practical parameters.
Physical layer security (PLS) has recently gained a lot of attention in the research and development of visible light communication (VLC). In this article, we study the designs of PLS in VLC systems in the presence of multiple unauthorized users (i.e. eavesdroppers) using artificial noise (AN)-aided precoding. The design objective focuses on minimizing the total transmit power subject to specific constraints on the signal-to-interference-plus-noise ratios (SINRs) of the legitimate and unauthorized users. In particular, two design approaches are investigated considering the availability of unauthorized users' channel state information (CSI) at the transmitter. In the case of unknown CSI, the AN is constructed to lie on the null-space of the legitimate user's channel. The design problem is convex, thus, can be effectively solved. When the CSI is available, the design additionally imposes constraints on the maximum allowable unauthorized users' SINRs. The design problem, in this case, is, nevertheless, non-convex. Therefore, instead of finding the optimal solution, we examine two different sub-optimal yet low-complexity approaches to solve the problem, namely: Concave-Convex Procedure (CCP) and Semidefinite Relaxation (SDR). Additionally, robust designs that take into account channel uncertainty are also investigated. Extensive numerical results are shown to demonstrate the feasibility and performance of each design with practical parameters.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available