2011/04/15 by Hussein Al-Zubaidy, Al-Zubaidy, Hussein, Changcheng Huang +3
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Networking and Internet Architecture (cs.NI) #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1104.3165
openalex publication_date 2011/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this work, we investigate the optimal dynamic packet scheduling policy in a wireless relay network (WRN). We model this network by two sets of parallel queues, that represent the subscriber stations (SS) and the relay stations (RS), with random link connectivity. An optimal policy minimizes, in stochastic ordering sense, the process of cost function of the SS and RS queue sizes. We prove that, in a system with symmetrical connectivity and arrival distributions, a policy that tries to balance the lengths of all the system queues, at every time slot, is optimal. We use stochastic dominance and coupling arguments in our proof. We also provide a low-overhead algorithm for optimal policy implementation.