Robust Wireless Scheduling under Arbitrary Channel Dynamics and Feedback Delay (Invited Paper)

Designing efficient scheduling algorithms is crucial to the development of modern wireless networks. In this paper, we study a wireless network model consisting of one central base-station and K mobile users. Each time the base-station can simultaneously transmit to 1 ≤ M ≤ K users. The channel states change over time adversarially, and the feedback of transmission outcome can experience arbitrary delays. The objective of the base-station is to search for a policy to maximize the overall transmission success rate. We propose a scheduling algorithm named Banker-OMD-Scheduling for this setting, based on a recent banker online mirror descent technique [1]. We show that Banker-OMD-Scheduling guarantees that the total regret over a finite time horizon T is $O\left( {\sqrt {MK} \left( {\sqrt T + \sqrt {D\log D} } \right)} \right)$ where D is the total feedback delay.