Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications
- Author: Liu Huanlin, Dai Hongyue, Chen Yong, Xia Peijie
- Publish: Journal of the Optical Society of Korea Volume 20, Issue1, p36~41, 25 Feb 2016
Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.
Visible light communications , Downlink resource allocation , Conflict graph scheduling , User scheduling , Throughput