Maximal Scheduling in Wireless Networks with Priorities

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, prioritized maximal scheduling, which compute a maximal set of transmitting links in each time slot according to certain pre-specified static priorities. The proposed scheduling scheme has low complexity, and is easily amendable for distributed implementation, such as adjusting inter-frame space (IFS) parameters under the ubiquitous 802.11 protocols. We provide throughput guarantees on the proposed scheduling scheme, by proving tight lower bound on the stability region and scheduling efficiency associated with a fixed priority vector. We next propose an online low complexity priority assignment algorithm, which can stabilize any arrival rate that is in the union of the lower bound regions of all priorities. The throughput guarantees are proved by fluid limits, and therefore can be applied to very general stochastic arrival processes. Finally, the performance of the proposed prioritized maximal scheduling scheme is verified by simulation results.