Offloading Hard-Deadline Constrained Traffic in Multi-Flow Interference-Aware Cellular Systems.

We consider a single BS serving G groups (flows) of users each with N real-time (RT) users. Each group is requesting to download some data by a hard-deadline at the end of a T-slot-frame. In addition, the BS is serving multiple non-real-time (NRT) users with no deadlines. The problem is to schedule the BS's transmission to the RT and NRT users to maximize the network's sum throughput, for users that are cooperating in the presence of interference. We present a scheduler with complexity of O(G(2)), where G is the number of RT groups in the system, and show it is throughput-optimal. Then we present extensive simulations to validate our findings.