Performance bounds for CSMA-based medium access control

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2011, Pages 5945-5950

  Freris, Nikolaos M ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Carrier Sense Multiple Access (CSMA); Distributed algorithms; Medium Access Control (MAC); Random access MAC; Resource allocation; Wireless Networks

Indexed keywords

CARRIER COMMUNICATION; CARRIER SENSE MULTIPLE ACCESS; LINEAR PROGRAMMING; PARALLEL ALGORITHMS; QUEUEING NETWORKS; RESOURCE ALLOCATION; SCHEDULING; WIRELESS NETWORKS;

CARRIER SENSE MULTIPLE ACCESS (CSMA); CENTRALIZED SCHEDULING; COMPARATIVE SIMULATION; MEDIUM ACCESS CONTROL(MAC); PRODUCT FORM STATIONARY DISTRIBUTION; RANDOM ACCESS; THROUGHPUT-OPTIMAL; UPPER AND LOWER BOUNDS;

MEDIUM ACCESS CONTROL;

EID: 84860665972     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2011.6160300     Document Type: Conference Paper

References (19)

1. 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, vol. 37(12) Dec. 1992, pp. 1936-1948.
2. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: shadow prices, proportional fairness and stability," Journal of the Operational Research Society, vol. 49, 1998, pp. 237-252.
3. X. Lin and N. B. Shroff, "Joint rate control and scheduling in multihop wireless networks," in Proceedings of the IEEE Conference on Decision and Control, Dec. 2004, pp. 237-252.
4. M. J. Neely, E. Modiano, and C. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," IEEE Journal on Selected Areas in Communications, vol. 23(1) Jan. 2005, pp. 89-103.
5. A. Eryilmaz and R. Srikant, "Joint congestion control, routing and MAC for stability and fairness in wireless networks," IEEE Journal on Selected Areas in Communications, vol. 24, Aug. 2006, pp. 1514-1524.
6. X. Lin, N. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," IEEE Selected Areas of Communications, vol. 14, 2006, pp. 1452-1463.
7. R. McCabe, N. Freris, and P. R. Kumar, "Controlled random access MAC for network utility maximization in wireless networks," in Proceedings of the 47th IEEE Conference on Decision and Control, Dec. 2008, pp. 2350-2355.
8. L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," in IEEE/ACM Transactions on Networking, vol. 18(3), Jun. 2010, pp. 960-972.
9. J. Ni and R. Srikant, "Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks," Information Theory and Applications Workshop (ITA), Feb. 2009.
10. S. C. Liew, C. Kai, J. Leung, and B. Wong, "Back-of-the-envelope computation of throughput distributions in CSMA wireless networks," in IEEE Transactions on Mobile Computing, vol. 9(9), Sep. 2010, pp. 1319-1331.
11. L. Jiang, J. Ni, R. Srikant, and J. Walrand, "Performance bounds of distributed CSMA scheduling," Information Theory and Applications Workshop (ITA), Feb. 2010.
12. G. R. Gupta and N. B. Shroff, "Delay Analysis for Wireless Networks with Single Hop Traffic and General Interference Constraints," in IEEE/ACM Transactions on Networking, vol. 18(2), Apr. 2010, pp. 393-405.
13. X. Wu, R. Srikant, and J. R. Perkins, "Queue-length stability of maximal greedy schedules in wireless networks," in IEEE Transactions on Mobile Computing, Jun. 2007, pp. 595-605.
14. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest queue-first scheduling: Second-order properties using fluid limits," in Advances in Applied Probabilities, vol. 38(2), 2006, pp. 505-521.
15. X. Wu, R. Srikant and R. Perkins "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks," in IEEE Transactions on Mobile Computing, vol. 6(6), Jun. 2007, pp. 595-605.
16. D. West, Introduction to Graph Theory. Englewood Cliffs, NJ: Prentice Hall, 1996.
17. D. Gross, J. Shortle, J. Thompson, and C. Harris Fundamentals of queueing Theory. Wiley Series in Probability and Statistics, Fourth Edition, 2008.
18. S. Kumar and P. R. Kumar, "Performance bounds for queueing networks and scheduling policies," in IEEE Transactions on Automatic Control, vol. 39(8), Aug. 1994, pp. 1600-1611.
19. P. R. Kumar and Sean P. Meyn, "Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies," IEEE Transactions on Automatic Control, vol. 41(1), Jan. 1996, pp. 4-17.