A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Data networks (2nd ed.)
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
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)
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Improved throughput bounds for interference-aware routing inwireless networks
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
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 network control for mobile multi-modal wireless sensor networks
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks
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)
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
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
IEEE/ACM Transactions on Networking (TON)
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
IEEE/ACM Transactions on Networking (TON)
FlashLinQ: a synchronous distributed scheduler for peer-to-peer ad hoc 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.00 |
In this paper, we characterize the performance of an important class of scheduling schemes, called greedy maximal scheduling (GMS), for multihop wireless networks. While a lower bound on the throughput performance of GMS has been well known, empirical observations suggest that it is quite loose and that the performance of GMS is often close to optimal. In this paper, we provide a number of new analytic results characterizing the performance limits of GMS. We first provide an equivalent characterization of the efficiency ratio of GMS through a topological property called the local-pooling factor of the network graph. We then develop an iterative procedure to estimate the local-pooling factor under a large class of network topologies and interference models. We use these results to study the worst-case efficiency ratio of GMS on two classes of network topologies. We show how these results can be applied to tree networks to prove that GMS achieves the full capacity region in tree networks under the K-hop interference model. Then, we show that the worst-case efficiency ratio of GMS in geometric unit-disk graphs is between 1/6 and 1/3.