Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

Authors:
Mathieu Leconte;Jian Ni;R. Srikant
Affiliations:
INRIA and Technicolor, Paris, France;Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 13
Cited 1

A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Greed is good: approximating independent sets in sparse and bounded-degree graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
A refined performance characterization of longest-queue-first policy in wireless networks

Proceedings of the tenth 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
Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
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
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless 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

Q-CSMA: queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the general k-hop interference model. These results improve the known bounds for networks with up to 26 nodes under the 2-hop interference model. We also prove that GMS is throughput-optimal in small networks. In particular, we show that GMS achieves 100% throughput in networks with up to eight nodes under the 2-hop interference model. Furthermore, we provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.