On the effect of channel fading on greedy scheduling

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 406-414

  Reddy, Akula Aneesh ^a   Sanghavi, Sujay ^a   Shakkottai, Sanjay ^a  

^a The University of Texas at Austin   (United States)

Author keywords

Channel Fading; Greedy Maximal Scheduling; Local Pooling factor; Throughput Region

Indexed keywords

CHANNEL VARIATIONS; DEGREE OF FREEDOM; GLOBAL STATE; LOCAL POOLING FACTOR; LOW-COMPLEXITY; OPTIMAL SCHEDULER; RELATIVE PERFORMANCE; THROUGHPUT PERFORMANCE; UPPER AND LOWER BOUNDS;

FADING CHANNELS; THROUGHPUT;

SCHEDULING;

EID: 84861638161     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195779     Document Type: Conference Paper

References (14)

1. Berk Birand, Maria Chudnovsky, Bernard Ries, Paul Seymour, Gil Zussman, and Yori Zwols. Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. In Proc. IEEE Infocom., San Diego, California, March 2010.
2. J. G. Dai. On positive harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. The Annals of Applied Probability, 5(1):49-77, 1995.
3. Antonis Dimakis and Jean Walrand. Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits. Advances in Applied Probability, 38(2):505-521, 2006.
4. L. Georgiadis, M.J. Neely, and L. Tassiulas. Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 1(1):1-144, 2006.
5. C. Joo, X. Lin, and N. B. Shroff. Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. IEEE/ACM Transactions on Networking, 17(4):1132-1145, August 2009.
6. Changhee Joo and Ness Shroff. Performance of random access scheduling schemes in multihop wireless networks. In Proc. IEEE Infocom., 2007.
7. Long Bao Le, Eytan Modiano, Changhee Joo, and Ness B. Shroff. Longest-queue-first scheduling under sinr interference model. In Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing, MobiHoc '10, pages 41-50, 2010.
8. Mathieu Leconte, Jian Ni, and Rayadurgam Srikant. Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks. In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, MobiHoc '09, 2009.
9. Bo Li, Cem Boyaci, and Ye Xia. A refined performance characterization of longest-queue-first policy in wireless networks. In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, MobiHoc '09, pages 65-74, New York, NY, USA, 2009.
10. Qiao Li and Rohit Negi. Greedy maximal scheduling in wireless networks. In GLOBECOM'10, pages 1-5, 2010.
11. X. Lin and S. Rasool. Constant-time distributed scheduling policies for ad hocwireless networks. In Proc. Conf. on Decision and Control, 2006.
12. Nick McKeown. Scheduling Algorithms for Input-Queued Cell Switches. PhD Thesis, University of California at Berkeley,, Berkeley, CA, 1995.
13. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Contr., 4:1936-1948, December 1992.
14. G. Zussman and A. Brzezinski; E. Modiano;. Multihop local pooling for distributed throughput maximization in wireless networks. In Proc. IEEE Infocom., Phoenix, Arizona, April 2008.