2020/01/15 by Christos Tsanikidis, Tsanikidis, Christos, Javad Ghaderi +1 · 1 citation
Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #Optimization and Control (math.OC) #Wireless Networks and Protocols
paper · pdf · doi:10.48550/arxiv.2001.05146
openalex publication_date 2020/01/15 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
In this paper, we consider the problem of scheduling real-time traffic in\nwireless networks under a conflict-graph interference model and single-hop\ntraffic. The objective is to guarantee that at least a certain fraction of\npackets of each link are delivered within their deadlines, which is referred to\nas delivery ratio. This problem has been studied before under restrictive\nframe-based traffic models, or greedy maximal scheduling schemes like LDF\n(Largest-Deficit First) that provide poor delivery ratio for general traffic\npatterns. In this paper, we pursue a different approach through randomization\nover the choice of maximal links that can transmit at each time. We design\nrandomized policies in collocated networks, multi-partite networks, and general\nnetworks, that can achieve delivery ratios much higher than what is achievable\nby LDF. Further, our results apply to traffic (arrival and deadline) processes\nthat evolve as positive recurrent Markov Chains. Hence, this work is an\nimprovement with respect to both efficiency and traffic assumptions compared to\nthe past work. We further present extensive simulation results over various\ntraffic patterns and interference graphs to illustrate the gains of our\nrandomized policies over LDF variants.\n