Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints

Link scheduling, i.e., which links should transmit together and for how long, has been and remains a cornerstone optimization problem in wireless networking. In minimum-time scheduling, the task is to minimize the amount of time before emptying the data demand residing at the source nodes. We derive a complete structural characterization of the solution that unifies and significantly extends the known results. First, we approach link scheduling...