CSMA over time-varying channels: Optimality, uniqueness and limited backoff rate

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2013, Pages 137-146

  Yun, Se Young ^a   Shin, Jinwoo ^b   Yi, Yung ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Backoff; CSMA; Time varying channel; Wireless Ad hoc network

Indexed keywords

ACHIEVABLE RATE REGION; BACKOFF; CARRIER SENSE MULTIPLE ACCESS (CSMA); CHANNEL INFORMATION; HIGH-PERFORMANCE DESIGN; THROUGHPUT OPTIMALITY; THROUGHPUT PERFORMANCE; TIME VARYING CHANNEL;

ALGORITHMS; CARRIER COMMUNICATION; ELECTRIC NETWORK TOPOLOGY; MOBILE AD HOC NETWORKS; OPTIMIZATION; SCHEDULING; THROUGHPUT; TIME VARYING NETWORKS; WIRELESS NETWORKS;

CARRIER SENSE MULTIPLE ACCESS;

EID: 84882939874     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2491288.2491303     Document Type: Conference Paper

References (29)

1. V. Anantharam and P. Tsoucas. A proof of the Markov chain tree theorem. Statistics & Probability Letters, 8(2):189-192, 1989.
2. L. Georgiadis, M. J. Neely, and L. Tassiulas. Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 1(1):1-149, 2006.
3. T. P. Hayes and A. Sinclair. A general lower bound for mixing of single-site dynamics on graphs. Annals of Applied Probability, 17(3):931-952, 2007.
4. L. Jiang, M. Leconte, J. Ni, R. Srikant, and J. Walrand. Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling. In Proceedings of Infocom, 2011.
5. L. Jiang, D. Shah, J. Shin, and J. Walrand. Distributed random access algorithm: Scheduling and congestion control. IEEE Transactions on Information Theory, 56(12):6182-6207, dec. 2010.
6. L. Jiang and J. Walrand. A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Transactions on Networking, 18(3):960-972, June 2010.
7. L. Jiang and J. Walrand. Scheduling and Congestion Control for Wireless and Processing Networks. Morgan-Claypool, 2010.
8. L. Jiang and J. Walrand. Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions. IEEE/ACM Transactions on Networking, 19(3):816-829, June 2011.
9. T. H. Kim, J. Ni, R. Srikant, and N. Vaidya. On the achievable throughput of CSMA under imperfect carrier sensing. In Proceedings of Infocom, 2011.
10. C.-H. Lee, D. Y. Eun, S.-Y. Yun, and Y. Yi. From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA. In Proceedings of ISIT, June 2012.
11. J. Lee, H. Lee, Y. Yi, S. Chong, B. Nardelli, and M. Chiang. Making 802.11 dcf near-optimal: Design, implementation, and evaluation. In Proceedings of IEEE Secon, 2013.
12. B. Li and A. Eryilmaz. A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless Fading Channels. ArXiv e-prints, Mar. 2012.
13. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor. Towards utility-optimal random access without message passing. Wiley Journal of Wireless Communications and Mobile Computing, 10(1):115-128, Jan. 2010.
14. M. Lotfinezhad and P. Marbach. Throughput-optimal random access with order-optimal delay. In Proceedings of Infocom, 2011.
15. B. Nardelli, J. Lee, K. Lee, Y. Yi, S. Chong, E. Knightly, and M. Chiang. Experimental evaluation of optimal CSMA. In Proc. IEEE INFOCOM, 2011.
16. 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 Proceedings of Infocom, 2010.
17. A. Proutiere, Y. Yi, T. Lan, and M. Chiang. Resource allocation over network dynamics without timescale separation. In Proceedings of Infocom, 2010.
18. D. Qian, D. Zheng, J. Zhang, and N. Shroff. CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model. In Proceedings of Infocom, 2010.
19. S. Rajagopalan, D. Shah, and J. Shin. Network adiabatic theorem: An efficient randomized protocol for contention resolution. In Proceedings of ACM Sigmetrics, 2009.
20. D. Shah and J. Shin. Delay optimal queue-based CSMA. In Proceedings of ACM Sigmetrics, 2010.
21. D. Shah and J. Shin. Randomized scheduling algorithm for queueing networks. Annals of Applied Probability, 22:128-171, 2012.
22. D. Shah, J. Shin, and P. Tetali. Medium access using queues. In Proceedings of IEEE FOCS, 2011.
23. L. Tassiulas. Scheduling and performance limits of networks with constantly changing topology. IEEE Transactions on Information Theory, 43(3):1067-1073, may 1997.
24. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1949, December 1992.
25. H. S. Wang and N. Moayeri. Finite-state markov channel-a useful model for radio communication channels. IEEE Transactions on Vehicular Technology, 44(1):163-171, feb 1995.
26. Y. Yi and M. Chiang. Next-Generation Internet Architectures and Protocols. Cambridge University Press, 2011. Chapter 9: Stochastic network utility maximization and wireless scheduling.
27. S.-Y. Yun, J. Shin, and Y. Yi. CSMA over time-varying channels: Optimality, uniqueness and limited backo? rate. ArXiv e-prints, 2013.
28. S.-Y. Yun, J. Shin, and Y. Yi. CSMA using the bethe approximation for utility maximization. In Proceedings of ISIT, 2013.
29. S.-Y. Yun, Y. Yi, J. Shin, and D. Y. Eun. Optimal CSMA: A survey. In Proceedings of ICCS, 2012.