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

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

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

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

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS NETWORKS; ARRIVAL RATES; CAPACITY REGIONS; COLLISION FREE TRANSMISSION; CONTINUOUS TIME; CONTROL PHASE; CSMA/CA; DELAY PERFORMANCE; DISCRETE TIME VERSION; DISCRETE-TIME; GLAUBER DYNAMICS; LOW DELAY; MAXIMUM THROUGH-PUT; MULTIPLE LINKS; OPTIMALITY; RANDOM ACCESS; RANDOMIZED ALGORITHMS; REDUCTION MECHANISMS; SIMULATION RESULT; STATISTICAL PHYSICS; TIME SLOTS;

AD HOC NETWORKS; THROUGHPUT;

ALGORITHMS;

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

References (22)

1. R. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin. Throughput analysis in multihop CSMA packet radio networks. IEEE Transactions on Communications, 35(3):267-274, March 1987.
2. C. Bordenave, D. McDonald, and A. Proutiere. Performance of random multi-access algorithms, an asymptotic approach. In Proceedings of ACM Sigmetrics, June 2008.
3. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proceedings of 43rd Annual Allerton Conference on Communication, Control and Computing, 2005.
4. A. Dimakis and J. Walrand. Sufficient conditions for stability of longest-queue- first scheduling: Second-order properties using fluid limits. Advances in Applied Probabilities, 38(2):505-521, 2006.
5. M. Durvy and P. Thiran. Packing approach to compare slotted and non-slotted medium access control. In Proceedings of IEEE INFOCOM, April 2006.
6. L. Georgiadis, M. Neely, and L. Tassiulas. Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 2006.
7. L. Jiang and J. Walrand. A distributed CSMA algorithm for throughput and utility maximization in wireless networks. In Proceedings 46th Annual Allerton Conference on Communication, Control and Computing, September 2008.
8. C. Joo, X. Lin, and N. B. Shroff. Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. In Proceedings of IEEE INFOCOM, April 2008.
9. M. Leconte, J. Ni, and R. Srikant. Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks. In Proceedings of ACM MOBIHOC, May 2009.
10. S. C. Liew, C. Kai, J. Leung, and B. Wong. Back-of-the-envelope computation of throughput distributions in CSMA wireless networks. Submitted for publication, http://arxiv.org//pdf/0712.1854.
11. X. Lin, N. B. Shroff, and R. Srikant. A tutorial on cross-layer optimization in wireless networks. IEEE Journal on Selected Areas in Communications, 2006.
12. P. Marbach, A. Eryilmaz, and A. Ozdaglar. Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints. In Proceedings of IEEE CDC, December 2007.
13. F. Martinelli. Lectures on Glauber dynamics for discrete spin models. Lectures on probability theory and statistics (Saint-Flour, 1997), Lecture Notes in Math., 1717, Springer, Berlin, 1999.
14. 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, August 2009. http://arxiv.org/abs/0901.2333.
15. A. Proutiere, Y. Yi, and M. Chiang. Throughput of random access without message passing. In Proceedings of CISS, March 2008.
16. S. Rajagopalan and D. Shah. Distributed algorithm and reversible network. In Proceedings of CISS, March 2008.
17. S. Rajagopalan, D. Shah, and J. Shin. Aloha that works, November 2008. Submitted.
18. S. Shakkottai and R. Srikant. Network optimization and control. Foundations and Trends in Networking, pages 271-379, 2007.
19. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximal throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1948, December 1992.
20. X. Wang and K. Kar. Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks. In Proceedings of IEEE INFOCOM, March 2005.
21. X. Wu, R. Srikant, and J. R. Perkins. Queue-length stability of maximal greedy schedules in wireless networks. IEEE Transactions on Mobile Computing, pages 595-605, June 2007.
22. G. Zussman, A. Brzezinski, and E. Modiano. Multihop local pooling for distributed throughput maximization in wireless networks. In Proceedings of IEEE INFOCOM, April 2008.