52.4ITJun 2
Secrecy Sum Rate Maximization for OIRS-Aided Visible Light Communications with Confidential MessagesTrinh K. Nguyen, Hung K. Hoang, Thanh V. Pham et al.
This paper investigates the secrecy sum-rate (SSR) performance of optical intelligent reflecting surface (OIRS)-assisted multi-user visible light communication (VLC) systems under line-of-sight (LoS) blockages. To mitigate physical obstructions and internal eavesdropping, a joint optimization problem is formulated to maximize the SSR through the co-design of the transmission precoder and OIRS units assignment. Due to the binary constraints and coupled variables, the problem is highly non-convex. To solve it efficiently, an alternating optimization (AO) framework integrating the concave-convex procedure (CCCP) and first-order Taylor approximations is developed. Simulation results demonstrate the convergence of the proposed algorithm and show that increasing the number of OIRS reflecting units yields significant SSR gains.
18.9SYJun 1
Secure RSMA-based Visible Light Networks under Spatial CorrelationHung K. Hoang, Chuyen T. Nguyen, Thang K. Nguyen et al.
This paper investigates the secrecy sum rate (SSR) of rate-splitting multiple access (RSMA)-based visible light communication (VLC) systems considering internal eavesdropping, where legitimate users may intercept private data intended for others. We formulate an optimization problem to maximize the SSR of the system, which is inherently non-convex due to the complex coupling of the objective function and constraints. To this end, two different approaches based on the convex-concave procedure (CCCP) and semidefinite relaxation (SDR) are leveraged to solve the non-convex parameterized problem. A central focus of this work is the investigation of channel similarity (CS), which serves as a metric for quantifying spatial correlation, and its impact on SSR performance. To mitigate the performance degradation caused by high spatial correlation, we propose a channel similarity reduction (CSR) clustering strategy that proactively minimizes CS to restore the system's degrees of freedom (DoF). Numerical results are provided to demonstrate the performance of the two proposed algorithms under various levels of CS. More importantly, the findings reveal that our proposed CSR-clustering strategy significantly outperforms existing baselines, effectively overcoming the secrecy performance ceiling caused by high spatial correlation.
21.7SYMay 31
Efficient Numerical Modeling of Near-Field Diffraction in ORIS-Assisted Free-Space Optical LinksTuan A. Hoang, Phuc V. Trinh, Shinya Sugiura et al.
This paper investigates near-field propagation in optical reconfigurable intelligent surface (ORIS)-assisted free-space optical (FSO) communication systems. Unlike conventional far-field scenarios, near-field propagation involves complex diffraction effects that hinder tractable closed-form analysis. To address this issue, a numerical framework for evaluating the optical field distribution of ORIS-assisted FSO links is proposed. Specifically, two numerical approaches are considered: direct Riemann-sum evaluation and a fast Fourier transform (FFT)-based method. Although the Riemann sum approach provides accurate field estimation, it incurs extremely high computational complexity due to the fine spatial discretization of the ORIS surface required at optical wavelengths. To improve computational efficiency, the optical-field calculation is reformulated as a convolution in the spatial-frequency domain, enabling efficient FFT-based propagation analysis. Simulation results demonstrate that the proposed FFT-based method achieves accuracy comparable to that of the Riemann-sum approach while significantly reducing computational complexity.