Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
Proceedings of the 12th annual international conference on Mobile computing and networking
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Making the case for random access scheduling in wireless multi-hop networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed coordination with deaf neighbors: efficient medium access for 60 GHz mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
Longest-queue-first scheduling under SINR interference model
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
On the stability of flow-aware CSMA
Performance Evaluation
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks
IEEE/ACM Transactions on Networking (TON)
A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels
IEEE/ACM Transactions on Networking (TON)
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
IEEE/ACM Transactions on Networking (TON)
Backoff mechanisms in narrow band and spread spectrum aloha networks
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Back-pressure-based packet-by-packet adaptive routing in communication networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
On the efficiency of CSMA-CA scheduling in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Delay-based back-pressure scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Throughput-optimal CSMA with imperfect carrier sensing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.06 |
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wireless networks. In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, we obtain performance bounds that improve upon previous results for larger networks up to a certain size. We also provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.