Visible light communication and WiFi hybrid networks based on dynamic resource allocation algorithm

• Published in: The Journal of supercomputing 2024-05, Vol.80 (7), p.8833-8856
• Main Authors: Yang, Liwei, Jia, Boyu, Liang, Xue, Wang, Fang, Peng, Xiangyuan
• Format: Article
• Language: English
• Subjects: Algorithms; Communication; Compilers; Computer Science; Fuzzy logic; Interpreters; Network latency; Optical communication; Processor Architectures; Programming Languages; Resource allocation; Resource utilization; Simulation; User experience; User satisfaction
• ISSN: 0920-8542; 1573-0484
• DOI: 10.1007/s11227-023-05791-2

Effective resource allocation is a crucial aspect in improving the performance of visible light communication (VLC)/hybrid WiFi networks. This study presents a dynamic resource allocation algorithm for multiuser scenarios. A fuzzy logic technique is employed to select the network resources with higher scores for communication. In this sense, to ensure fairness in the hybrid VLC-WiFi network, an enhanced proportional fairness (PF) algorithm is utilized. The algorithm considers the access delay and the distance to the access point as users move, striking a reasonable balance between fair allocation of user resources and maximizing system resource utilization. Therefore, to enhance the user experience in real-time scheduling, a compensation factor is introduced to compensate users with higher latency, increasing their priority. A thorough analysis is provided for the throughput, latency, utility value, and fairness models of the VLC-WiFi heterogeneous network system. The algorithm proposed in this paper is simulated and compared with four traditional algorithms, namely the Round-Robin algorithm, maximum carrier to interference ratio (Max C/I) algorithm, modified largest weighted delay first algorithm, and PF algorithm, under different metrics. Simulation results show that the proposed method is effective, and the improved algorithm yields better fairness and higher throughput compared to the conventional algorithm. As the number of frames increases, the fairness index of the proposed algorithm increases the fastest and gradually converges to 1. The throughput of this method is significantly greater than that of previous algorithms, reaching a stable rate of roughly 1.3 Mbps. The suggested algorithm is approximately 150% higher than the throughput achieved by conventional PF algorithms. The algorithm improves user satisfaction in different regions, and the utility value remains around 0.975. The packet loss rate is approximately 75% lower than traditional typical algorithms, and the average latency is approximately 60% lower. Simulation results show that the proposed algorithm has good application prospects in heterogeneous networks.