A tabu search-based LED selection approach safeguarding visible light communication systems
Ge Shi
TL;DR
This work tackles secrecy in a multi-UE VLC system by formulating a sum secrecy rate maximization over discrete LED–UE assignments. It introduces a tabu-search-based LED selection algorithm to navigate the non-convex, combinatorial search space, along with three lightweight strategies and a global search benchmark for comparison. Results show the TS approach achieves near-optimal secrecy performance with substantially faster convergence than exhaustive search, while simple strategies lag by a notable margin; performance improves with more UEs or higher LED power and is influenced by Eve's FoV and localization accuracy. The findings offer a practical mechanism to balance secrecy performance and computational complexity in indoor VLC networks, with future work aimed at robustness to imperfect Eve-position information.
Abstract
In this paper, we investigate the secrecy performance of a single-input single-output visible light communication (VLC) channel in the presence of an eavesdropper. The studied VLC system comprises distributed light-emitting diodes (LEDs) and multiple randomly located users (UEs) within an indoor environment. A sum secrecy rate maximization problem is formulated to enhance confidential transmission by selecting the optimal LED for each UE. To address the non-convex and non-continuous nature of this problem, we propose a tabu search-based algorithm that prevents entrapment in local optima by organizing the trial vectors from previous iterations. Furthermore, we develop three straightforward LED selection strategies that reduce computational complexity by employing fixed criteria to choose one LED for each UE. We also examine the convergence and complexity analysis of the proposed algorithm and strategies. The results demonstrate that the secrecy performance of our proposed algorithm is very close to the global optimal value and surpasses that of the developed strategies.
