Greedy maximal scheduling in wireless networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2010, Pages

  Li, Qiao ^a   Negi, Rohit ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; MAXIMUM PRINCIPLE; SCHEDULING ALGORITHMS; WIRELESS NETWORKS;

CLOSED FORM; GREEDY MAXIMAL SCHEDULING; GREEDY SCHEDULING ALGORITHMS; LONGEST QUEUE FIRSTS; LOW BOUND; PRIORITY ASSIGNMENT; PRIORITY VECTOR; QUEUE LENGTHS; STABILITY REGIONS; STATIC PRIORITY SCHEDULING;

SCHEDULING;

EID: 79551646760     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2010.5683487     Document Type: Conference Paper

References (11)

1. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. on Automatic Control, Vol. 37, No. 12, pp. 1936-1949, December 1992
2. L. Tassiulas, "Linear Complexity Algorithms for Maximum Througput in Radio Networks and Input Queued Switches," Proc. of IEEE INFOCOM, 533-539, 1998
3. L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks", Allerton Conference on Communication, Control, and Computing, 2008
4. P. Chaporkar, K. Kar, X. Luo, and S. Sarkar, "Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks", IEEE Trans. on Info. Theory, Vol. 54, No. 2, February 2008, pp. 572-594.
5. A. Dimakis and J.Walrand, "Sufficient Conditions for Stability of Longest Queue First Scheduling: Second Order Properties Using Fluid Limits," Journal of Applied Probability, May 2005.
6. C. Joo, X. Lin, and N. B. Shroff, "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks," IEEE INFOCOM, Phoenix, Arizona, April 2008
7. Q. Li and R. Negi, "Prioritized Maximal Scheduling in Wireless Networks", Proc. of IEEE Globecom, 2008
8. Q. Li and R. Negi, "Scheduling in Wireless Multi-hop Networks with Priorities", Proc. of IEEE Infocom, 2009
9. J.G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," Proc. of the IEEE INFOCOM, 2:556-564, March 2000.
10. Q. Li and R. Negi, "Greedy Maximal Scheduling in Wireless Networks", Tech Report, available at http://arxiv.org/abs/1007.4840
11. B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman and Y. Zwols, "Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory," Proc. IEEE INFOCOM 2010, Mar. 2010