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

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2009, Pages 165-174

  Leconte, Mathieu ^a   Ni, Jian ^a   Srikant, R ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Greedy maximal scheduling; Longest queue first; Throughput optimality; Wireless networks

Indexed keywords

EIGHT NODE; GREEDY MAXIMAL SCHEDULING; IN-NETWORK; INTERFERENCE MODELS; LARGER NETWORKS; LOW COMPLEXITY; NEIGHBORHOOD INFORMATION; OPTIMALITY; PERFORMANCE BOUNDS; THROUGHPUT EFFICIENCY; THROUGHPUT PERFORMANCE;

AD HOC NETWORKS; COMPUTER SCIENCE; MOBILE AD HOC NETWORKS; QUEUEING THEORY; SCHEDULING; TELECOMMUNICATION NETWORKS; THROUGHPUT;

WIRELESS NETWORKS;

EID: 70450206174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1530748.1530771     Document Type: Conference Paper

References (15)

1. A. Brzezinski, G. Zussman, and E. Modiano. Enabling distributed throughput maximization in wireless mesh networks - a partitioning approach. In Proceedings of ACM MOBICOM'06, September 2006.
2. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees in maximal scheduling in wireless networks. In Proceedings 43rd Annual Allerton Conference on Communication, Control and Computing, September 2005.
3. A. Dimakis and J. Walrand. Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits. Advances in Applied Probabilities, 38(2):505-521, 2006.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
5. B. Hajek and G. Sasaki. Link scheduling in polynomial time. IEEE Transactions on Information Theory, pages 910-917, 1988.
6. J.-H. Hoepman. Simple distributed weighted matchings. http://arxiv.org/abs/cs.DC/0410047, October 2004.
7. C. Joo. A local greedy scheduling scheme with provable performance guarantee. In Proceedings of ACM MOBIHOC'08, Hong Kong SAR, China, May 2008.
8. C. Joo, X. Lin, and N. B. Shroff. Performance limits of greedy maximal matching in multi-hop wireless networks. In Proceedings of IEEE CDC'07, December 2007.
9. C. Joo, X. Lin, and N. B. Shroff. Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. In Proceedings of IEEE INFOCOM'08, April 2008.
10. X. Lin and N. B. Shroff. The impact of imperfect scheduling on cross-layer control in multihop wireless networks. In Proceedings of IEEE INFOCOM'05, 2005.
11. N. McKeown. Scheduling Algorithms for Input-Queued Cell Switches. University of California, Berkeley, 1995.
12. R. Preis. Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In Proceedings of STACS'99, 1999.
13. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximal throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1948, December 1992.
14. X. Wu and R. Srikant. Scheduling e±ciency of distributed greedy scheduling algorithms in wireless networks. In Proceedings of IEEE INFOCOM'06, April 2006.
15. G. Zussman, A. Brzezinski, and E. Modiano. Multihop local pooling for distributed throughput maximization in wireless networks. In Proceedings of IEEE INFOCOM'08, April 2008.