Abstract:
The performance of wireless scheduling algorithms directly depends on the availability and accuracy of channel state information (CSI) at the scheduler. As CSI updates mu...Show MoreMetadata
Abstract:
The performance of wireless scheduling algorithms directly depends on the availability and accuracy of channel state information (CSI) at the scheduler. As CSI updates must propagate across the network, they are delayed as they arrive at the controller. In this paper, we analyze the effect that delayed CSI has on the throughput performance of scheduling in wireless networks. By accounting for the delays in CSI as they relate to the network topology, we revisit the comparison between centralized and distributed scheduling. We explore the tradeoff between optimal centralized scheduling using delayed CSI and imperfect distributed scheduling using timely CSI. In particular, we show that under certain conditions distributed scheduling outperforms the optimal centralized scheduling policy and we characterize the point at which distributed scheduling outperforms centralized scheduling for tree and clique networks. Lastly, we propose a partially distributed scheme that achieves high throughput amidst delayed CSI.
Published in: IEEE Transactions on Mobile Computing ( Volume: 17, Issue: 11, 01 November 2018)