A Refined Performance Characterization of Longest-Queue-First Policy in Wireless Networks

• Published in: IEEE/ACM transactions on networking Vol. 19; no. 5; pp. 1382 - 1395
• Main Authors: Bo Li, Boyaci, C., Ye Xia
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2011; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Communities; Focusing; Interference; local pooling; Longest Queue First (LQF) policy; Optimization; Policies; Recognition; Schedules; Scheduling; Scheduling algorithm; stability; Stability analysis; Studies; Wireless networks; wireless networks scheduling
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2011.2108314

One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to be NP-hard. The research community is currently focusing on finding simpler suboptimal scheduling algorithms and on characterizing the algorithm performance. In this paper, we address the performance of a specific scheduling policy called Longest Queue First (LQF), which has gained significant recognition lately due to its simplicity and high efficiency in empirical studies. There has been a sequence of studies characterizing the guaranteed performance of the LQF schedule, culminating at the construction of the σ-local pooling concept by Joo In this paper, we refine the notion of σ -local pooling and use the refinement to capture a larger region of guaranteed performance.