Throughput and Fairness maximization in Wireless Networks

In this paper, a single-antenna broadcast channel with large (K) number of users is considered. It is assumed that all users have a hard delay constraint D. We propose a scheduling algorithm for maximizing the throughput of the system, while satisfying the delay constraint for all users. It is proved that by using the proposed algorithm, it is possible to achieve the maximum throughput and minimum delay in the network, simultaneously, in the asymptotic case of K rarr co. We introduce a new notion of fairness in the network, called "minimum average throughput", and prove that the proposed algorithm maximizes the minimum average throughput in a broadcast channel. Finally, the proposed algorithm is generalized for MIMO broadcast channels (MIMO-BC).