• Acta Optica Sinica
  • Vol. 39, Issue 9, 0906007 (2019)
Xiangwei Bai, Qing Li*, and Yanqun Tang
Author Affiliations
  • Information System Engineering Institute, Information Engineering University, Zhengzhou, Henan 450000, China
  • show less
    DOI: 10.3788/AOS201939.0906007 Cite this Article Set citation alerts
    Xiangwei Bai, Qing Li, Yanqun Tang. Low-Complexity Spectrum Resource Allocation Algorithm for Indoor Ultra-Dense Visible Light Communication Networks[J]. Acta Optica Sinica, 2019, 39(9): 0906007 Copy Citation Text show less

    Abstract

    A low-complexity spectrum resource allocation algorithm with near-optimal system throughput is proposed to resolve the conflict between high system throughput and low complexity of the multi-cell resource allocation algorithm for indoor ultra-dense visible light communication (UD-VLC) networks. Firstly, through establishing the optimal model of the resource allocation problem in each cell, we derive the conclusion that the problem is a convex optimization problem. Then, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment, and the resource allocation algorithm is proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves 57% performance improvement on average system throughput and 67% performance improvement on quality of service (QoS) satisfaction against the required data rate proportion allocation (RDR-PA) method.
    Xiangwei Bai, Qing Li, Yanqun Tang. Low-Complexity Spectrum Resource Allocation Algorithm for Indoor Ultra-Dense Visible Light Communication Networks[J]. Acta Optica Sinica, 2019, 39(9): 0906007
    Download Citation