Title :
Greedy Maximal Scheduling in Wireless Networks
Author :
Li, Qiao ; Negi, Rohit
Author_Institution :
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
Abstract :
In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.
Keywords :
expectation-maximisation algorithm; greedy algorithms; radio networks; scheduling; closed-form lower bound stability region; expectation-maximization algorithm; greedy maximal scheduling algorithm; heuristic priority assignment algorithm; longest queue first scheduling; priority vector; static priority scheduling; wireless networks; Complexity theory; Heuristic algorithms; Optimal scheduling; Processor scheduling; Scheduling; Stability analysis; Wireless networks;
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location :
Miami, FL
Print_ISBN :
978-1-4244-5636-9
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2010.5683487