I will cover three of our recent works on age optimal scheduling problems in wireless networks. First, I will discuss how to extend the performance guarantees of centralized max-weight style protocols to distributed CSMA style protocols in the AoI setting. Second, I will introduce a correlated monitoring problem, for which I will establish that simple AoI scheduling policies are nearly optimal. Third, I will discuss how to extend max-weight style Lyapunov policies to a setting where sources send differently sized updates. Together, the three works tackle open questions in wireless scheduling for real-time applications.
Short Bio: