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

作者：Li Bo^*; Boyaci Cem; Xia Ye

来源：IEEE/ACM Transactions on Networking, 2011, 19(5): 1382-1395.

DOI：10.1109/TNET.2011.2108314

• Interference
• local pooling
• Longest Queue First (LQF) policy
• stability
• wireless networks scheduling

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 sigma-local pooling concept by Joo et al. In this paper, we refine the notion of sigma-local pooling and use the refinement to capture a larger region of guaranteed performance.

• 出版日期2011-10