We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference model takes network geometry and the cumulative interference effect into account, which, therefore, capture the wireless interference more precisely than binary interference models. By employing the ρ-local pooling technique, we show that LQF scheduling achieves zero throughput in the worst case. We then propose a novel technique to localize interference which enables us to decentralize the LQF scheduling while preventing it from having vanishing throughput in all network topologies. We characterize the maximum throughput region under interference localization and present a distributed LQF scheduling algorithm. Finally, we present numerical results to illustrate the usefulness and to validate the theory developed in the paper.
Finally, the authors in REF have studied the performance of GMS with the SINR interference model, and have shown that GMS exhibits zero LPF in the worst case.
Longest-queue-first scheduling under SINR interference model
MobiHoc '10
Computer Science Engineering