On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networks

In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least certain fraction packets each link are delivered within their deadlines, which referred as delivery ratio. This has been studied before restrictive frame-based models, or greedy maximal schemes like LDF (Largest-Deficit First) can lead poor ratio for general patterns. pursue different approach through randomization over choice links transmit time. We design randomized policies collocated networks, multi-partite achieve ratios much higher than what achievable by LDF. Further, our results apply any (arrival deadline) process evolves an unknown positive recurrent Markov chain. Hence, work improvement with respect both efficiency assumptions compared past work. further present extensive simulation various patterns graphs illustrate gains variants.