Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Journal of the Optical Society of Korea
  • Vol. 20,
  • Issue 1,
  • pp. 36-41
  • (2016)

Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications

Open Access Open Access

Abstract

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.

© 2016 Optical Society of Korea

PDF Article
More Like This
Scheduling for indoor visible light communication based on graph theory

Yuyang Tao, Xiao Liang, Jiaheng Wang, and Chunming Zhao
Opt. Express 23(3) 2737-2752 (2015)

Improvement of indoor VLC network downlink scheduling and resource allocation

Yan Chen, Anthony E. Kelly, and John H. Marsh
Opt. Express 24(23) 26838-26850 (2016)

Graph-based multi-user scheduling for indoor cooperative visible light transmission

Jiajun Deng, Xianqing Jin, Xiaoting Ma, Meiyu Jin, Chen Gong, and Zhengyuan Xu
Opt. Express 28(11) 15984-16002 (2020)

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.


Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved