Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study

In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with a given mean and variance of the bit-rate in a time-slot, and a given distribution for the number of time-slots allocated within a time-window. Based on this general result, we evaluate closed-form expressions for the TGVPs for four well-known scheduling algorithms. Through simulations we also show that our TGVP approximation is tight for a realistic network with moving users with correlated channels and realistic throughput guarantees.