JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications
Liu, Huanlin; Dai, Hongyue; Chen, Yong; Xia, Peijie;
  PDF(new window)
 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.
 Keywords
Visible light communications;Downlink resource allocation;Conflict graph scheduling;User scheduling;Throughput;
 Language
Korean
 Cited by
 References
1.
K. Suzuke, K. Asahi, and A. Watanabe, “Basic study on receiving light signal by LED for bidirectional visible light communications,” Electronics and Communications in Japan 2, 268-274 (2015).

2.
S. Tao, J. Tang, T. Yin, W. Ping, and L. Yu, “Multi-users network model and the corresponding networking scheme for indoor VLC systems,” Opt. Express 9, 11600-11618 (2015).

3.
J. Zhang and H. Wang, “An improved SNR uniformity optimization scheme for VLC system,” Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition) 1, 78-82 (2015).

4.
Z. Wang, Y. H. Liu, and Y. P. Lin, “Full-duplex MAC protocol based on adaptive contention window for visible light communication,” Optical Communications and Networking 3, 164-171 (2015).

5.
O. Babatundi, Q. Lijun, and C. Julian, "Downlink scheduling in visible light communications," in Proc. IEEE 2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP) (Heifei, China, Oct. 2014), pp. 1-6.

6.
S. Borst, “User-level performance of channel-aware scheduling algorithms in wireless data networks,” IEEE/ACM Transactions on Networking 3, 636-647 (2003).

7.
H. J. Kushner and P. A. Whiting, “Convergence of proportional-fair sharing algorithms under general conditions,” IEEE Transactions on Wireless Communications 4, 1250-1259 (2004).

8.
Z. T. Huang and Y. F. Ji, “Efficient user access and lamp selection in LED-based visible light communication network,” Chin. Opt. Lett. 5, 1-5 (2012).

9.
Y. Y. Li, L. J. Wang, and J. X. Ning, "VICO: A framework for configuring indoor visible light communication networks," in Proc. IEEE 9th International Conference on MASS (Las Vegas, NV, USA, Oct. 2012), pp. 136-144.

10.
H. Xin, X. Q. Fu, and W. Xu, “Incremental scheduling scheme for indoor visible light communication,” Electron. Lett. 3, 268-270 (2015).

11.
Y. Y. Tao, L. Xiao, and J. H. Wang, “Scheduling for indoor visible light communication based on graph theory,” Opt. Express 3, 2737-2752 (2015).

12.
Y. L. Wang and H. Haas, “Dynamic load balancing with handover in hybrid li-fi and wi-fi networks,” IEEE J. Lightwave Technol. 22, 4671-4682 (2015).

13.
X. Li, R. Zhang, and L. Hanzo, “Cooperative load balancing in hybrid visible light communications and wifi,” IEEE Transactions on Communications 4, 1319-1329 (2014).

14.
T. Komine and M. Nakagawa, “Fundamental analysis for visible- light communication system using LED lights,” IEEE Transactions on Consumer Electronics 1, 100-107 (2004).

15.
D. Q. Ding and X. Z. Ke, “Research on generalized mathematic radiation model for white LED,” Acta Optica Sinica 9, 2536-2540 (2010).

16.
B. Bensaou, K. T. Chan, and D. H. K. Tsang, "Credit-Based Fair Queueing(CBFQ): A simple and feasible scheduling algorithm for packet networks," in Proc. IEEE ATM Workshop (Lisboa, Portugal, May 1997), pp. 589-594.