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

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.

[1]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Saikat Ray,et al.  Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning , 2008, IEEE Transactions on Automatic Control.

[3]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[4]  Koushik Kar,et al.  Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.

[5]  E. Modiano,et al.  Distributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning , 2008, IEEE/ACM Transactions on Networking.

[6]  Changhee Joo,et al.  A local greedy scheduling scheme with provable performance guarantee , 2008, MobiHoc '08.

[7]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[8]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[9]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

[10]  Eytan Modiano,et al.  Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach , 2006, MobiCom '06.

[11]  Eytan Modiano,et al.  Longest-queue-first scheduling under SINR interference model , 2010, MobiHoc '10.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[14]  Jaap-Henk Hoepman,et al.  Simple Distributed Weighted Matchings , 2004, ArXiv.

[15]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[16]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[17]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[18]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  Paul D. Seymour,et al.  Analyzing the performance of greedy maximal scheduling via local pooling and graph theory , 2010, S3 '10.

[20]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[22]  Ye Xia,et al.  A Refined Performance Characterization of Longest-Queue-First Policy in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[23]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[24]  Ness B. Shroff,et al.  Performance limits of greedy maximal matching in multi-hop wireless networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[25]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[26]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[27]  Koushik Kar,et al.  Queue Length Stability in Trees Under Slowly Convergent Traffic Using Sequential Maximal Scheduling , 2008, IEEE Transactions on Automatic Control.

[28]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[29]  Leandros Tassiulas,et al.  Low-complexity distributed fair scheduling for wireless multi-hop networks , 2005 .