Optimal CSMA-based wireless communication with worst-case delay and non-uniform sizes

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 2526-2534

  Li, Hongxing ^a   Vaidya, Nitin ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CARRIER COMMUNICATION; COMPLEX NETWORKS; CONVOLUTIONAL CODES; SCHEDULING; THROUGHPUT; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

CARRIER SENSE MULTIPLE ACCESS PROTOCOLS; DATA COMMUNICATION PROTOCOLS; DATA-COMMUNICATION; EXPONENTIAL DELAY; POLYNOMIAL COMPLEXITY; RIGOROUS ANALYSIS; THROUGHPUT OPTIMALITY; WIRELESS COMMUNICATIONS;

CARRIER SENSE MULTIPLE ACCESS;

EID: 84904421915     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848199     Document Type: Conference Paper

References (19)

1. P.-K. Huang and X. Lin. Improving the delay performance of csma algorithms: A virtual multi-channel approach. In Proc. of IEEE INFOCOM' 13, 2013.
2. L. Jiang, M. Leconte, J. Ni, R. Srikant, and J. Walrand. Fast mixing of parallel glauber dynamics and low-delay csma scheduling. In Proc. of IEEE INFOCOM'11, 2011.
3. L. Jiang, J. Ni, R. Srikant, and J. Walrand. Performance bounds of distributed csma scheduling. In Proc. of ITA'10, 2010.
4. L. Jiang and J. Walrand. Convergence analysis of a distributed csma algorithm for maximal throughput in a general class of networks. Technical report, UC Berkeley, 2008.
5. L. Jiang and J. Walrand. A distributed csma algorithm for throughput and utility maximization in wireless networks. ACM/IEEE Transactions on Networking, 18:960-972, 2010.
6. K. Lam, C. Chau, M. Chen, and S. Liew. Mixing time and temporal starvation of general csma networks with multiple frequency agility. In Proc. of IEEE ISIT'12, 2012.
7. C.-H. Lee, D. Y. Eun, S.-Y. Yun, and Y. Yi. From glauber dynamics to metropolis algorithm: Smaller delay in optimal csma. In Proc. of IEEE ISIT'12, 2012.
8. B. Li and A. Eryilmaz. A fast-csma algorithm for deadline-constrained scheduling over wireless fading channels. In Proc. of RAWNET'11, 2011.
9. H. Li and N. Vaidya. Optimal csma-based wireless communication with worst-case delay and non-uniform sizes. Technical report, Available online: Http://arxiv.org/abs/1401.3511, 2014.
10. X. Lin, N. B. Shroff, and R. Srikant. A tutorial on cross-layer optimization in wireless networks. IEEE Journal on Selected Areas in Communications, 24:1452-1463, 2006.
11. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor. Maximizing utility via random access without message passing. Technical report, Microsoft Research, 2008.
12. M. Lotfinezhad and P. Marbach. Throughput-optimal random access with order-optimal delay. In Proc. of IEEE INFOCOM'11, 2011.
13. M. J. Neely. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan&Claypool Publishers, 2010.
14. M. J. Neely. Opportunistic scheduling with worst case delay guarantees in signle and multi-hop networks. In Proc. of IEEE INFOCOM'11, 2011.
15. 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. of IEEE INFOCOM'10, 2010.
16. D. Shah and J. Shin. Delay optimal queue-based csma. In Proc. of ACM SIGMETRICS'10, 2010.
17. D. shah, D. Tse, and J. N. Tsitsiklis. Hardness of low delay network scheduling. In Proc. of Information Theory Workshop, 2010.
18. V. Subramanian and M. Alanyali. Delay performance of csma in networks with bounded degree conflict graphs. In Proc. of IEEE ISIT'11, 2011.
19. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37:1936-1948, 1992.