Achieving optimal throughput utility and low delay with CSMA-like algorithms: A virtual multichannel approach

IEEE/ACM Transactions on Networking

Volumn 23, Issue 2, 2015, Pages 505-518

  Huang, Po Kai ^a,b   Lin, Xiaojun ^a  

^a PURDUE UNIVERSITY   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Carrier sense multiple access (CSMA); distributed scheduling; Markov chain; starvation; utility maximization; virtual multiple channels

Indexed keywords

ALGORITHMS; CARRIER COMMUNICATION; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; SCHEDULING; THROUGHPUT;

CARRIER SENSE MULTIPLE ACCESS (CSMA); DISTRIBUTED SCHEDULING; MULTIPLE CHANNELS; STARVATION; UTILITY MAXIMIZATIONS;

CARRIER SENSE MULTIPLE ACCESS;

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

References (28)

1. P.-K. Huang and X. Lin, "Improving the delay performance of CSMA algorithms: A virtual multi-channel approach," in Proc. IEEE INFOCOM, 2013, pp. 2598-2606.
2. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
3. 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.
4. L. Georgiadis, M. J. Neely, and L. Tassiulas, "Resource allocation and cross-layer control in wireless networks," Found. Trends Netw., vol. 1, no. 1, pp. 1-144, 2006.
5. L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 960-972, Jun. 2010.
6. 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," IEEE/ACM Trans. Netw., vol. 20, no. 3, pp. 825-836, Jun. 2012.
7. C. Borgs, J. T. Chayes,A.Frieze, J. H.Kim, P. Tetali, E.Vigoda, and V. H. Vu, "Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics," in Proc. IEEE FOCS, 1999, pp. 218-229.
8. M. Lotfinezhad and P. Marbach, "Throughput-optimal random access with order-optimal delay," in Proc. IEEE INFOCOM, 2011, pp. 2867-2875.
9. D. Shah,D.N.Tse, and J. N. Tsitsiklis, "Hardness of low delay network scheduling," IEEE Trans. Inf. Theory, vol. 57, no. 12, pp. 7810-7817, Dec. 2011.
10. 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, Oct. 2008.
11. D. Shah and J. Shin, "Delay optimal queue-based CSMA," Perform. Eval. Rev., vol. 38, no. 1, pp. 373-374, 2010.
12. L. Jiang, M. Leconte, J. Ni, R. Srikant, and J. Walrand, "Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling," IEEE Trans. Inf. Theory, vol. 58, no. 10, pp. 6541-6555, Oct. 2012.
13. V. G. Subramanian and M. Alanyali, "Delay performance of CSMA in networks with bounded degree conflict graphs," in Proc. IEEE ISIT, 2011, pp. 2373-2377.
14. B. Li and A. Eryilmaz, "Optimal distributed scheduling under timevarying conditions: A fast-CSMA algorithm with applications," IEEE Trans. Wireless Commun., vol. 12, no. 7, pp. 3278-3288, Jul. 2013.
15. 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. IEEE ISIT, 2012, pp. 2681-2685.
16. K.-K. Lam, C.-K. Chau, M. Chen, and S.-C. Liew, "Mixing time and temporal starvation of general CSMA networks with multiple frequency agility," in Proc. IEEE ISIT, 2012, pp. 2676-2680.
17. D. Xue and E. Ekici, "On reducing delay and temporal starvation of queue-length-based CSMA algorithms," in Proc. 50th Annu. Allerton Conf. Commun., Control, Comput., 2012, pp. 754-761.
18. A. Proutiere, Y. Yi, T. Lan, and M. Chiang, "Resource allocation over network dynamics without timescale separation," in Proc. IEEE INFOCOM, 2010, pp. 1-5.
19. Y. Yi, G. de Veciana, and S. Shakkottai, "Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm," in Proc. IEEE WiMesh, 2006, pp. 23-32.
20. D. Qian, D. Zheng, J. Zhang, N. B. Shroff, and C. Joo, "Distributed CSMA algorithms for link scheduling in multihop MIMO networks under SINR model," IEEE/ACM Trans. Netw., vol. 21, no. 3, pp. 746-759, Jun. 2013.
21. S. Zhou, X. Wu, and L. Ying, "Distributed power control and codingmodulation adaptation in wireless networks using annealed Gibbs sampling," in Proc. IEEE INFOCOM, 2012, pp. 3016-3020.
22. S. Boyd, Convex Optimization. : Cambridge University Press, 2004.
23. D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar, Convex Analysis and Optimization. Belmont, MA, USA: Athena Scientific, 2003.
24. D. Gross and C. Harris, Fundamentals of Queueing Theory, 4th ed. Hoboken, NJ, USA: Wiley, 2008.
25. P.-K. Huang and X. Lin, "Achieving optimal throughput utility and low delay with CSMA-like algorithms: A virtual multi-channel approach," Purdue University, West Lafayette, IN, USA, Tech. Rep., 2014 [Online]. Available: http://docs.lib.purdue.edu/ecetr/455/
26. D. E. Knuth, Art of Computer Programming Volume 2: Seminumerical Algorithms, 3rd ed. Reading, MA, USA: Addison-Wesley, 1997.
27. S. M. Ross, Stochastic Processes, 2nd ed. New York, NY, USA: Wiley, 1996.
28. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," IEEE/ACM Trans. Netw., vol. 17, no. 6, pp. 1846-1859, Dec. 2009.