Implementing utility-optimal CSMA

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 102-111

  Lee, Jinsung ^d   Lee, Junhee ^d   Yi, Yung ^d   Chong, Song ^a,b,c   Proutière, Alexandre ^a,b,c   Chiang, Mung ^a,b,c  

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

^b MICROSOFT RESEARCH   (United Kingdom)

^c Princeton University   (United States)

^d NONE

Author keywords

802.11; CSMA; Distributed algorithm; Optimization; Random access; Scheduling; Systems; Wireless networks

Indexed keywords

CSMA; DISTRIBUTED ALGORITHM; DISTRIBUTED SCHEDULING; LEGACY EQUIPMENT; MODELING AND ANALYSIS; OPTIMALITY; RANDOM ACCESS; THEORY AND PRACTICE; WIRELESS SCHEDULING;

CARRIER SENSE MULTIPLE ACCESS; MESSAGE PASSING; OPTIMIZATION; WIRELESS NETWORKS;

SCHEDULING ALGORITHMS;

EID: 77949639042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394849     Document Type: Conference Paper

References (38)

1. 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 Control, vol. 37, no. 12, pp. 1936-1949, 1992.
2. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radionetworks and input queued switches," in Proceedings of IEEE Infocom, San Francisco, CA, 1998.
3. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in Proceedings of the 43rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, 2005.
4. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in Proceedings of ACM Sigmetrics, Saint Malo, France, 2006.
5. A. Eryilmaz, A. Ozdaglar, and E. Modiano, "Polynomial complexity algorithms for full utilization of multi-hop wireless networks," in Proceedings of Infocom, Anchorage, AK, 2007.
6. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead," in Proceedings of ACM Sigmetrics, San Diego, CA, 2007.
7. S. Ray and S. Sarkar, "Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning," in Proceedings of Information Theory and Applications Second Workshop, La Jolla, CA, 2007.
8. C. Joo and N. B. Shroff, "Performance of random access scheduling schemes in multi-hop wireless networks," in Proceedings of Infocom, Anchorage, AK, 2007.
9. Y. Yi and M. Chiang, "Wireless scheduling with O(1) complexity for m-hop interference model," in Proceedings of IEEE International Conference on Communications, Beijing, China, 2008.
10. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," in Proceedings of IEEE Infocom, Anchorage, AK, 2007.
11. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in Proceedings of IEEE Conference on Decision and Control, San Diego, CA, 2006.
12. K. Kar, S. Sarkar, and L. Tassiulas, "Achieving proportional fairness using local information in aloha networks," IEEE Transactions on Automatic Control, vol. 49, no. 10, pp. 1858-1862, 2004.
13. J. W. Lee, M. Chiang, and R. A. Calderbank, "Utility-optimal medium access control: reverse and forward engineering," in Proceedings of IEEE Infocom, Barcelona, Spain, 2006.
14. X. Wang and K. Kar, "Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access," in Proceedings of ACM Mobihoc, Urbana-Champaign, IL, 2005.
15. A. H. Mohsenian-Rad, J. Huang, M. Chiang, and V. W. S. Wong, "Utility-optimal random access: Optimal performance without frequent explicit message passing," IEEE Transactions on Wireless Communications, vol. 8, no. 2, pp. 898-911, 2009.
16. --, "Utility-optimal random access: Reduced complexity, fast convergence, and robust performance," IEEE Transactions on Wireless Communications, vol. 8, no. 2, pp. 898-911, 2009.
17. J. Liu, A. Stolyar, M. Chiang, and H. V. Poor, "Queue backpressure random access in multihop wireless networks: Optimality and stability," IEEE Transactions on Information Theory, vol. 55, no. 9, 2008.
18. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on crosslayer rate control in wireless networks," in Proceedings of IEEE Infocom, Miami, FL, 2005.
19. M. J. Neely, E. Modiano, and C. Li, "Fairness and optimal stochastic control for heterogeneous networks," in Proceedings of IEEE Infocom, Miami, FL, 2005.
20. L. Chen, S. H. Low, M. Chiang, and J. C. Doyle, "Joint optimal congestion control, routing, and scheduling in wireless ad hoc networks," in Proceeding of IEEE Infocom, Barcelona, Spain, 2006.
21. A. Eryilmaz and R. Srikant, "Joint congestion control, routing, and MAC for stability and fairness in wireless networks," IEEE Journal on Selected Areas of Communication (JSAC), Special Issue on Nonlinear Optimization of Communication Systems Systems, vol. 24, no. 8, pp. 1514-1524, 2006.
22. A. L. Stolyar, "Maximizing queueing network utility subject to statbility: greedy primal-dual algorithm," Queueing Systems Theory and Applications, vol. 50, no. 4, pp. 401-457, 2005.
23. Y. Yi and M. Chiang, "Stochastic network utility maximization and wireless scheduling," 2009, to be published as a book chapter of Next-Generation Internet Architectures and Protocols, Cambridge University Press. Also, available at http://lanada.kaist.ac.kr/pubs/scheduling. pdf.
24. Y. Yi, A. Proutiere, and M. Chiang, "Complexity in wireless scheduling: Impact and tradeoffs," in Proceedings of ACM Mobihoc, Hong Kong, China, 2008.
25. Y. Yi, J. Zhang, and M. Chiang, "Delay and effective throughput of wireless scheduling in heavy traffic regimes: Vacation model for complexity," in Proceedings of ACM Mobihoc, New Orleans, LA, 2009.
26. L. Jiang and J. Walrand, "A CSMA distributed algorithm for throughput and utility maximization in wireless networks," in Proceedings of the 46th Annual Conference on Communication, Control and Computing, Monticello, IL, 2008.
27. S. Rajagopalan and D. Shah, "Distributed algorithm and reversible network," in Proceedings of the Cconference on Information Science and Systems, Princeton, NJ, 2008.
28. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor, "Adaptive CSMA: Approaching optimality without message passing," Wiley Journal of Wireless Communications and Mobile Computing, Special Issue on Recent Advances in Wireless Communications and Networking, Networking,, Dec. 2009. Preliminary version in Microsoft Research Technical Report, TR2008-128, 2008.
29. F. Kelly, "Stochastic models of computer communication systems," Journal of the Royal Statistical Society, vol. 47, no. 3, pp. 379-395, 1985.
30. M. Durvy and P. Thiran, "Packing approach to compare slotted and non-slotted medium access control," in Proceedings of IEEE Infocom, Barcelona, Spain, 2006.
31. C. Bordenave, D. McDonald, and A. Proutiere, "Performance of random medium access control: An asymptotic approach," in Proceedings of ACM Sigmetrics, Annapolis, MD, 2008.
32. F. Kelly, Reversibility and Stochastic Networks. Wiley, Chichester, 1979.
33. V. Borkar, "Stochastic approximation with controlled markov noise," Systems and control letters, vol. 55, pp. 139-145, 2006.
34. S. Shrestha, J. Lee, A. Lee, K. Lee, J. Lee, and S. Chong, "An open wireless mesh testbed architecture with data collection and software distribution platform," in In Proceedings of TridentCom, Orlando, FL, 2007.
35. "Ns-2," http://www.isi.edu/nsnam/ns/.
36. "Glomosim," http://pcl.cs.ucla.edu/projects/glomosim/.
37. J. Lee, J. Lee, S. Shrestha, and S. Chong, "Common code architecture for future internet researches of wireless mesh networks," in Proceedings of CFI, Seoul, Korea, 2008.
38. "Madwifi project," http://madwifi-project.org/.