Open AccessIncremental scheduling scheme for indoor visible light communication
Author(s) -
Huang Xin,
Fu Xuequn,
Xu Wei
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.3994
Subject(s) - computer science , dynamic priority scheduling , round robin scheduling , fair share scheduling , two level scheduling , rate monotonic scheduling , distributed computing , scheduling (production processes) , earliest deadline first scheduling , fixed priority pre emptive scheduling , real time computing , computer network , mathematical optimization , mathematics , quality of service
Light‐emitting diode (LED) access point (AP) scheduling can provide both significant performance gains and flexible user access for visible light communications. However, the scheduling for multiple moving users, which requires adaptive LED AP scheduling for user movements and is practical in common scenarios, has so far rarely been studied. An incremental scheduling scheme is proposed to introduce a time division scheduling framework to solve the scheduling problem with multiple moving users. The proposed scheme consists of two phases: global scheduling and local scheduling. In the global scheduling phase, a scheduling scheme based on graph theory is proposed to assign users to different timeslots to eliminate inter‐user interference. In the local scheduling phase, the result of global scheduling is adjusted for user movements. Simulation results show that the proposed scheme improves system capacity with reduced complexity.