title: Scheduling for indoor visible light communication based on graph theory.
abstract: Visible light communication (VLC) has drawn much attention in the field of high-rate indoor wireless communication. While most existing works focused on point-to-point VLC technologies, few studies have concerned multiuser VLC, where multiple optical access points (APs) transmit data to multiple user receivers. In such scenarios, inter-user interference constitutes the major factor limiting the system performance. Therefore, a proper scheduling scheme has to be proposed to coordinate the interference and optimize the whole system performance. In this work, we aim to maximize the sum rate of the system while taking into account user fairness by appropriately assigning LED lamps to multiple users. The formulated scheduling problem turns out to be a maximum weighted independent set problem. We then propose a novel and efficient resource allocation method based on graph theory to achieve high sum rates. Moreover, we also introduce proportional fairness into our scheduling scheme to ensure the user fairness. Our proposed scheduling scheme can, with low complexity, achieve more multiplexing gains, higher sum rate, and better fairness than the existing works.
authors.forename: Yuyang
authors.initials: Y
authors.lastname: Tao
authors.forename: Xiao
authors.initials: X
authors.lastname: Liang
authors.forename: Jiaheng
authors.initials: J
authors.lastname: Wang
authors.forename: Chunming
authors.initials: C
authors.lastname: Zhao