Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Maximum Weighted Matching with Interference Constraints
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON)
Performance of random access scheduling schemes in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Low-complexity distributed scheduling algorithms for wireless networks
IEEE/ACM Transactions on Networking (TON)
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
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 et al. In this paper, we refine the notion of σ-local pooling and use the refinement to capture a larger region of guaranteed performance.