Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

IEEE/ACM Transactions on Networking

Volumn 20, Issue 3, 2012, Pages 825-836

  Ni, Jian ^a   Tan, Bo ^b   Srikant, R ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

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

Author keywords

Carrier sense multiple access (CSMA); random access; scheduling algorithms; wireless networks

Indexed keywords

CARRIER COMMUNICATION; CONTINUOUS TIME SYSTEMS; SCHEDULING ALGORITHMS; STATISTICAL PHYSICS; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; CARRIER SENSE MULTIPLE ACCESS (CSMA); COLLISION FREE TRANSMISSION; DISCRETE TIME VERSION; GREEDY MAXIMAL SCHEDULING; RANDOM ACCESS; RANDOMIZED ALGORITHMS; THROUGHPUT OPTIMALITY;

CARRIER SENSE MULTIPLE ACCESS;

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

References (32)

1. U. Akyol, M. Andrews, P. Gupta, J. Hobby, I. Saniee, and A. Stolyar, "Joint scheduling and congestion control in mobile ad-hoc networks," in Proc. IEEE INFOCOM, April 2008, pp. 619-627.
2. V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, "MACAW: A media access protocol for wireless LAN's," in Proc. ACM SIGCOMM, 1994, pp. 212-225.
3. G. Bianchi, "Performance analysis of the IEEE 802. 11 distributed coordination function," IEEE J. Sel. Areas Commun. , vol. 18, no. 3, pp. 535-547, Mar. 2000.
4. R. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin, "Throughput analysis in multihop CSMA packet radio networks," IEEE Trans. Commun. , vol. COM-35, no. 3, pp. 267-274, Mar. 1987. (Pubitemid 17549112)
5. C. Bordenave, D. McDonald, and A. Proutiere, "Performance of random medium access algorithms, an asymptotic approach," in Proc. ACM SIGMETRICS, Jun. 2008, pp. 1-12.
6. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in Proc. 43rd Annu. Allerton Conf. Commun. , Control, Comput. , Sep. 2005, pp. 28-30.
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. Durvy and P. Thiran, "A packing approach to compare slotted and non-slotted medium access control," in Proc. IEEE INFOCOM, Apr. 2006, pp. 1-12.
9. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Netw. , vol. 13, no. 2, pp. 411-424, Apr. 2005. (Pubitemid 40690835)
10. L. Georgiadis, M. Neely, and L. Tassiulas, "Resource allocation and cross-layer control in wireless networks," Found. Trends Netw. , vol. 1, no. 1, pp. 1-149, 2006.
11. J. Ghaderi and R. Srikant, "On the design of efficient CSMA algorithms for wireless networks,"Mar. 2010 [Online]. Available: http://arxiv. org/abs/1003. 1364
12. L. Jiang and J. Walrand, "Convergence analysis of a distributed CSMA algorithm for maximal throughput in a general class of networks," UC Berkeley, Berkeley, CA, Tech. Rep. , Dec. 2008.
13. L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," in Proc. 46th Annu. Allerton Conf. Commun. , Control, Comput. , Sep. 2008, pp. 1511-1519.
14. L. Jiang and J. Walrand, "Approaching throughput-optimality in a distributed CSMA algorithm with contention resolution," UC Berkeley, Berkeley, CA, Tech. Rep. , March 2009.
15. 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 Trans. Netw. , vol. 17, no. 4, pp. 1132-1145, Aug. 2009.
16. F. Kelly, Reversibility and Stochastic Networks. Chichester, U. K. : Wiley, 1979.
17. M. Leconte, J. Ni, and R. Srikant, "Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks," IEEE/ACM Trans. Netw. , vol. 19, no. 3, pp. 709-720, Jun. 2011.
18. S. C. Liew, C. Kai, J. Leung, and B. Wong, "Back-of-the-envelope computation of throughput distributions in CSMA wireless networks," IEEE Trans. Mobile Comput. , vol. 9, no. 9, pp. 1319-1331, Sep. 2010.
19. X. Lin, N. B. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," IEEE J. Sel. Areas Commun. , vol. 24, no. 8, pp. 1452-1463, Aug. 2006.
20. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor, "Maximizing utility via random access without message passing," Microsoft Research, Tech. Rep. , Sep. 2008.
21. P. Marbach, A. Eryilmaz, and A. Ozdaglar, "Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints," in Proc. IEEE CDC, Dec. 2007, pp. 1156-1161. (Pubitemid 351277309)
22. J. Ni, B. R. 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.
23. A. Proutiere, Y. Yi, and M. Chiang, "Throughput of random access without message passing," in Proc. CISS, Mar. 2008, pp. 509-514.
24. S. Rajagopalan and D. Shah, "Distributed algorithm and reversible network," in Proc. CISS, Mar. 2008, pp. 498-502.
25. S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: An efficient randomized protocol for contention resolution," in Proc. ACM SIGMETRICS, Jun. 2009, pp. 133-144.
26. S. Shakkottai and R. Srikant, "Network optimization and control," Found. Trends Netw. , vol. 2, no. 3, pp. 271-379, 2007. (Pubitemid 351256642)
27. 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.
28. E. Vigoda, "A note on the Glauber dynamics for sampling independent sets," J. Combin. , vol. 8, pp. 1-8, 2001. (Pubitemid 39064850)
29. X. Wang and K. Kar, "Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks," in Proc. IEEE INFOCOM, Mar. 2005, vol. 1, pp. 23-34. (Pubitemid 41390804)
30. A. Warrier, S. Janakiraman, and I. Rhee, "DiffQ: Practical differential backlog congestion control for wireless networks," in Proc. IEEE INFOCOM, Apr. 2009, pp. 262-270.
31. 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)
32. 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.