Secrecy Capacity of Hybrid VLC-RF Systems with Light Energy Harvesting
Tuan A. Hoang, Thanh V. Pham, Chuyen T. Nguyen
TL;DR
The paper addresses secrecy capacity in the uplink RF transmission of a hybrid VLC-RF system employing SLIPT and TDMA. It develops a DC-program formulation to maximize the sum secrecy capacity $\\sum_{k=1}^K C_{S,k}$ by jointly optimizing downlink and uplink time slots under a downlink sum-rate constraint $R^{dl}_{sum} \\ge r_{min}$, leveraging the decomposition $C_{S,k}=u_k - v_k$ with $u_k$ and $v_k$ concave. The optimization is solved efficiently using the DC algorithm (DCA), with energy harvesting characterized by $E_k = \\\eta I_D^2 g_k^2 (1-\\tau_k^{dl})$ and UL power $P_k = E_k/\\tau_k^{ul}$. Simulation results reveal a fundamental trade-off between harvested energy, UL secrecy capacity, and DL rate as the number of users varies, and they uncover DL-rate fairness concerns in multiuser scenarios. The work provides a practical framework for secure, energy-harvesting hybrid VLC-RF networks and suggests future work to address fairness among users' DL rates.
Abstract
This paper studies the performance of physical layer security (PLS) in a multi-user hybrid heterogeneous visible light communication (VLC) and radio frequency (RF) wireless communication system with simultaneous lightwave information and power transfer (SLIPT). In the considered system, VLC is used for downlink (DL) while RF is employed for uplink (UL) transmission. In addition, to support multiple users, time division multiple access (TDMA) is assumed for both DL and UL channels. In the DL, each user receives information during its allocated time slot of the TDMA frame and harvests energy from the received signal outside the time slot. The harvested energy is then used for transmitting the signal over the UL channel, which is subject to eavesdropping by an unauthorized user. Therefore, PLS is employed to protect the confidentiality of the UL information. Then, an optimization problem is formulated to solve the optimal DL and UL time slots that maximize the PLS performance given a target sum rate of the DL. We show that the problem can be cast as a difference of convex functions (DC) program, which can be solved efficiently using the DC algorithm (DCA).