Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking

Volumn 17, Issue 4, 2009, Pages 1132-1145

  Joo, Changhee ^a   Lin, Xiaojun ^b   Shroff, Ness B ^a  

^a OHIO STATE UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Capacity region; Communication systems; Greedy maximal scheduling (GMS); Longest queue first; Multihop wireless networks

Indexed keywords

CAPACITY REGION; CAPACITY REGIONS; EFFICIENCY RATIO; GREEDY MAXIMAL SCHEDULING (GMS); INTERFERENCE MODELS; ITERATIVE PROCEDURES; LARGE CLASS; LONGEST QUEUE FIRST; LOWER BOUNDS; MULTIHOP WIRELESS NETWORK; MULTIHOP WIRELESS NETWORKS; NETWORK GRAPH; NETWORK TOPOLOGY; PERFORMANCE LIMITS; SCHEDULING SCHEMES; THROUGHPUT PERFORMANCE; TOPOLOGICAL PROPERTIES; TREE NETWORK; UNIT DISK GRAPHS; WORST-CASE EFFICIENCY;

COMMUNICATION SYSTEMS; CONTROL THEORY; ELECTRIC NETWORK TOPOLOGY; SCHEDULING ALGORITHMS;

WIRELESS NETWORKS;

EID: 69249215199     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2026276     Document Type: Article

References (31)

1. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximal throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
2. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer congestion control in wireless networks," IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 302-315, Apr. 2006.
3. G. Sharma, C. Joo, and N. B. Shroff, "Distributed scheduling schemes for throughput guarantees in wireless networks," in Proc. 44th Annu. Allerton Conf. Commun., Control, and Comput., Sep. 2006, pp. 1396-1405.
4. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in IEEE CDC, Dec. 2006, pp. 1258-1263.
5. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," Sigmetrics Perform. Eval. Rev., vol. 34, no. 1, pp. 27-38, 2006.
6. C. Joo and N. B. Shroff, "Performance of random access scheduling schemes in multi-hop wireless networks," in Proc. IEEE INFOCOM, May 2007, pp. 19-27.
7. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," in Proc. IEEE INFOCOM May 2007, pp. 1631-1639.
8. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead," in Proc. ACM Sigmetrics, Jun. 2007, pp. 313-324.
9. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity.. Englewood Cliffs, NJ: Prentice-Hall, 1982.
10. B. Hajek and G. Sasaki, "Link scheduling in polynominal time," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 910-917, Sep. 1988.
11. S. Sarkar and L. Tassiulas, "End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks," in Proc. IEEE CDC, Dec. 2003, pp. 564-569.
12. P. Chaporkar, K. Kar, X. Luo, and S. Sarkar, "Throughput and fairness guarantees through maximal scheduling in wireless networks," IEEE Trans. Inf. Theory, vol. 54, no. 2, pp. 572-594, Feb. 2008.
13. X. Wu and R. Srikant, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks," in Proc. IEEE INFOCOM Apr. 2006, pp. 1-12.
14. G. Sharma, N. B. Shroff, and R. R. Mazumdar, "On the complexity of scheduling in wireless networks," in Proc. ACM MobiCom, Sep. 2006, pp. 227-238.
15. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "On the stability of input-queued switches with speed-up," IEEE/ACM Trans. Netw., vol. 9, no. 1, pp. 104-118, Feb. 2001.
16. N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph.D. dissertation, Univ. California, Berkeley, 1995.
17. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits," Adv. Appl. Probab., vol. 38, no. 2, pp. 505-521, 2006.
18. J.-H. Hoepman, "Simple distributed weighted matchings," Oct. 2004 [Online]. Available: http://arxiv.org/abs/cs/0410047v1
19. V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, "Algorithmic aspects of capacity in wireless networks," in Proc. ACM Sigmetrics, 2005, pp. 133-144.
20. A. Brzezinski, G. Zussman, and E. Modiano, "Enabling distributed throughput maximization in wireless mesh networks: A partitioning approach," in Proc. ACM MobiCom, 2006, pp. 26-37.
21. G. Zussman, A. Brzezinski, and E. Modiano, "Multihop local pooling for distributed throughput maximization in wireless networks," in Proc. IEEE INFOCOM, Apr. 2008, pp. 1139-1147.
22. R. Gallager and D. Bertsekas, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice Hall, 1991.
23. J. G. Dai, "On positive harris recurrence of multiclass queueing networks: A unified approach via fluid limit models," Ann. Appl. Probab., vol. 5, no. 1, pp. 49-77, 1995.
24. M. J. Neely, E. Modiano, and C. E. Rohrs, "Power allocation and routing in multibeam satellites with time-varying channels," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 138-152, Feb. 2003.
25. R. L. Cruz and A. V. Santhanam, "Optimal routing, link scheduling and power control in multi-hop wireless networks," in Proc. IEEE INFOCOM San Francisco, Apr. 2003, pp. 702-711.
26. C. Joo, X. Lin, and N. B. Shroff, "Performance limits of greedy maximal matching in multi-hop wireless networks," in Proc. IEEE CDC, Dec. 2007, pp. 1128-1133.
27. C. Joo, X. Lin, and N. B. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks," Ohio State Univ., Columbus, 2008, Tech. Rep. [Online]. Available: http://www.ece.osu.edu/~cjoo
28. V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, "End-to-end packet-scheduling in wireless ad-hoc networks," in Proc. SODA, 2004, pp. 1021-1030.
29. H. Balakrishnan, C. L. Barrett, V. S. A. Kumar, M. V. Marathe, and S. Thite, "The distance-2 matching problem and its relationship to the MAC-layer capacity of Ad Hoc wireless networks," IEEE J. Sel. Areas Commun., vol. 22, no. 6, pp. 1069-1079, Aug. 2004.
30. A. Israeli and A. Itai, "A fast and simple randomized parallel algorithm for maximal matching," Inf. Process. Lett., vol. 22, no. 2, pp. 77-80, 1986.
31. C. Buragohain, S. Suri, C. Toth, and Y. Zhou, "Improved throughput bounds for interference-aware routing in wireless networks," in Proc. COCOON, 2007, pp. 210-221.