Greedy maximal matching: Performance limits for arbitrary network graphs under the node-exclusive interference model

IEEE Transactions on Automatic Control

Volumn 54, Issue 12, 2009, Pages 2734-2744

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

^a OHIO STATE UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Efficiency ratio; Greedy maximal matching (GMM); Local pooling factor; Wireless scheduling

Indexed keywords

ANALYTICAL RESULTS; ARBITRARY NETWORKS; EFFICIENCY RATIO; INTERFERENCE MODELS; LOWER BOUNDS; MAXIMAL MATCHINGS; MULTI-HOP TRAFFIC; MULTIHOP WIRELESS NETWORK; NETWORK GRAPH; NETWORK TOPOLOGY; PERFORMANCE LIMITS; SCHEDULING SCHEMES; SINGLE-HOP TRAFFIC; TOPOLOGICAL NOTIONS; WIRELESS SCHEDULING;

CONTROL THEORY; ELECTRIC NETWORK TOPOLOGY; MAGNETOSTRICTIVE DEVICES; PACKET NETWORKS; SCHEDULING;

WIRELESS NETWORKS;

EID: 72349089767     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2009.2031719     Document Type: Article

References (25)

1. 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. (Pubitemid 351277305)
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. 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.
4. 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. (Pubitemid 47334211)
5. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks" in Proc. IEEE CDC, Dec. 2006.
6. G. Sharma, N. B. Shroff, and R. R. Mazumdar, "Joint congestion control and distributed scheduling for throughput guarantees in wireless networks" in Proc. IEEE INFOCOM, May 2007, pp. 2072-2080.
7. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches" in Proc. IEEE IN-FOCOM, Apr. 1998, pp. 533-539.
8. S. Ray and S. Sarkar, "Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning" IEEETrans. Autom. Control, vol. 52, no. 10, pp. 2307-2323, Nov. 2008.
9. 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, Comput., Sep. 2006,.
10. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks" in Proc. IEEE INFOCOM, May 2007, pp. 1631-1639. (Pubitemid 47334391)
11. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead" in Proc. ACMSigmetrics, Jun. 2007, pp. 313-324.
12. 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.
13. B. Hajek and G. Sasaki, "Link scheduling in polynominal time" IEEE Trans. Inform. Theory, vol. IT-34, no. 5, pp. 910-917, Sep. 1988.
14. 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.
15. C. H. Papadimitriou and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
16. 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.
17. N. McKeown, "Scheduling Algorithms for Input-Queued Cell Switches" Ph.D. dissertation, Univ. California, Berkeley, 1995.
18. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits" Adv. Appl. Prob., vol. 38, no. 2, pp. 505-521, 2006.
19. 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.
20. J.-H. Hoepman, Simple Distributed Weighted Matchings eprint, October 2004 [Online]. Available: http://arxiv.org/abs/cs/0410047v1
21. C. Joo, X. Lin, and N. B. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks" in Proc. IEEE INFOCOM, Apr. 2008, pp. 1103-1111.
22. J. G. Dai, "On positive harris recurrence of multiclass queueing networks: A unified approach via fluid limit models" Annals Appl. Prob., vol. 5, no. 1, pp. 49-77, 1995.
23. C. Joo, X. Lin, and N. B. Shroff, Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model Ohio State Univ., Columbus, OH, Tech. Rep., 2009 [Online]. Available: http://www.ece.osu.edu/~cjoo
24. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Joint asynchronous congestion control and distributed scheduling for multi-hop wireless networks" in Proc. IEEE INFOCOM, Apr. 2006, pp. 1-12.
25. X. Wu, R. Srikant, and J. R. Perkins, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks" IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 595-605, Jun. 2007. (Pubitemid 46685739)