Wireless scheduling

Scheduling algorithms have been extensively studied in wireless network design. We first present a comprehensive taxonomy of this research area, including optimality and robustness issues in the frameworks of Layering as Optimization Decomposition and Stochastic NUM. Then we discuss the stability-delay-complexity tradeoff, as well as delay characterizations, in networks with non-saturated traffic. We conclude with reverse and forward engineering of random access protocols in networks with saturated traffic, including convergence and short-term fairness of utility-optimal CSMA with no message passing.