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

IEEE/ACM Transactions on Networking

Volumn 19, Issue 3, 2011, Pages 709-720

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

^a INRIA and Technicolor   (France)

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

Author keywords

Greedy Maximal Scheduling (GMS); Longest Queue First (LQF); throughput optimality; wireless networks

Indexed keywords

ARBITRARY TOPOLOGY; EIGHT NODE; GREEDY MAXIMAL SCHEDULING (GMS); INTERFERENCE MODELS; LONGEST QUEUE FIRST (LQF); NEIGHBORHOOD INFORMATION; SMALL NETWORKS; THROUGHPUT EFFICIENCY;

SCHEDULING; THROUGHPUT; TOPOLOGY;

WIRELESS NETWORKS;

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

References (28)

1. N. Alon, L. Babai, and A. Itai, "A fast and simple randomized parallel algorithm for the maximal independent set problem," J. Algor., vol. 7, no. 4, pp. 567-583, 1986.
2. S. Basagni, "Finding a maximal weighted independent set in wireless networks," Telecommun. Syst., vol. 18, no. 1-3, pp. 155-168, 2001.
3. 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," in Proc. IEEE INFOCOM,Mar. 2010, pp. 1-9.
4. A. Brzezinski, G. Zussman, and E. Modiano, "Enabling distributed throughput maximization in wireless mesh networks-A partitioning approach," in Proc. ACM MobiCom, Sep. 2006, pp. 26-37. (Pubitemid 44758701)
5. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees in maximal scheduling in wireless networks," in Proc. 43rd Annu. Allerton Conf. Commun., Control Comput., Sep. 2005, pp. 1557-1567.
6. R. L. Cruz, "A calculus for network delay, part I: Network elements in isolation," IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 114-131, Jan. 1991.
7. 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. (Pubitemid 44057301)
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
9. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inf. Theory, vol. 34, no. 5, pt. 1, pp. 910-917, Sep. 1988.
10. M. Halldórsson and J. Radhakrishnan, "Greed is good: Approximating independent sets in sparse and bounded-degree graphs," in Proc. STOC, 1994, pp. 439-448.
11. J.-H. Hoepman, "Simple distributed weighted matchings," Oct. 2004 [Online]. Available: http://arxiv.org/abs/cs.DC/0410047
12. C. Joo, "A local greedy scheduling scheme with provable performance guarantee," in Proc. ACM MobiHoc, May 2008, pp. 111-120.
13. 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)
14. C. Joo, X. Lin, and N. B. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks," IEEE/ACM Trans. Netw., vol. 17, no. 4, pp. 1132-1145, Aug. 2009.
15. L. B. Le, E. Modiano, C. Joo, and N. B. Shroff, "Longest-queue-first scheduling under SINR interference model," in Proc. ACM MobiHoc, Sep. 2010, pp. 41-50.
16. M. Leconte, J. Ni, and R. Srikant, "Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks," in Proc. ACM MobhiHoc, May 2009, pp. 165-174.
17. B. Li, C. Boyaci, and Y. Xia, "A refined performance characterization of longest-queue-first policy in wireless networks," in Proc. ACM MobiHoc, May 2009, pp. 65-74.
18. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks," in Proc. IEEE INFOCOM, 2005, vol. 3, pp. 1804-1814. (Pubitemid 41390694)
19. M. Luby, "A simple parallel algorithm for the maximal independent set problem," in Proc. STOC, 1985, pp. 1-10. (Pubitemid 15595092)
20. N. McKeown, "Scheduling algorithms for input-queued cell switches," Univ. California, Berkeley, 1995.
21. J. Ni, B. Tan, and R. Srikant, "Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks," in Proc. IEEE INFOCOM, Mar. 2010, pp. 1-5.
22. A. Penttinen, I. Koutsopoulos, and L. Tassiulas, "Low-complexity distributed fair scheduling for wireless multi-hop networks," in Proc. RAWNET, 2005.
23. R. Preis, "Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs," in Proc. STACS, 1999, pp. 259-269.
24. S. Sarkar and K. Kar, "Queue length stability in trees under slowly convergent traffic using sequential maximal scheduling," IEEE Trans. Autom. Control, vol. 53, no. 10, pp. 2292-2306, Nov. 2008.
25. S. Sarkar and S. Ray, "Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning," IEEE Trans. Autom. Control, vol. 53, no. 10, pp. 2307-2323, Nov. 2008.
26. 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.
27. X. Wu and R. Srikant, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks," in Proc. IEEE INFOCOM, Apr. 2006, pp. 1-12.
28. G. Zussman, A. Brzezinski, and E. Modiano, "Multihop local pooling for distributed throughput maximization in wireless networks," in Proc. IEEE INFOCOM, Apr. 2008.