Convergence and stability of a distributed CSMA algorithm for maximal network throughput

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2009, Pages 4840-4845

  Jiang, Libin ^a   Walrand, Jean ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CARRIER COMMUNICATION; RANDOM PROCESSES; STOCHASTIC SYSTEMS;

CONVERGENCE AND STABILITY; DISTRIBUTED SCHEDULING ALGORITHMS; JOINT SCHEDULING; MAXIMAL THROUGHPUT; NETWORK THROUGHPUT; RESOURCE SHARING; STOCHASTIC PROCESSING NETWORKS; UTILITY MAXIMIZATIONS;

CARRIER SENSE MULTIPLE ACCESS;

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

References (17)

1. X. Lin, N.B. Shroff, R. Srikant, "A Tutorial on Cross-Layer Optimization in Wireless Networks," IEEE Journal on Selected Areas in Communications, vol.24, no.8, pp. 1452-1463, Aug. 2006.
2. 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, 36:1936-1948, Dec. 1992.
3. X. Wang and K. Kar, "Throughput Modelling and Fairness Issues in CSMA/CA Based Ad-Hoc Networks," IEEE INFOCOM 2005, Miami, Mar. 2005.
4. S. C. Liew, C. Kai, J. Leung, B. Wong, "Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks," http://arxiv.org//pdf/0712.1854
5. L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," the Forty-Sixth Annual Allerton Conference on Communication, Control, and Computing, Sep. 23-26, 2008.
6. L. Jiang and J. Walrand, "A Distributed Algorithm for Maximal Throughput and Optimal Fairness in Wireless Networks with a General Interference Model", Technical Report, UC Berkeley, Apr. 2008. URL: http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-38.html
7. J. M. Harrison and R. J. Williams, "Workload interpretation for Brownian models of stochastic processing networks," Mathematics of Operations Research, 32 (2007), pp. 808-820.
8. L. Jiang and J. Walrand, "Approaching Throughput-Optimality in a Distributed CSMA Algorithm: Collisions and Stability," (invited), ACM Mobihoc'09 S3 Workshop, May 2009.
9. L. Jiang, J. Walrand, "Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput," Technical Report, UC Berkeley, Mar. 2009. URL: http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS- 2009-43.html
10. J. Ni and R. Srikant, "Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks," Information Theory and Applications Workshop, Feb. 2009.
11. S. Rajagopalan and D. Shah, "Distributed Algorithm and Reversible Network", Conference on Information Sciences and Systems, Princeton, NJ, USA, Mar. 2008.
12. S. Rajagopalan, D. Shah, J. Shin, "Network adiabatic theorem: an efficient randomized protocol for contention resolution," ACM Sigmetrics, Jun. 2009.
13. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor, "Convergence and Tradeoff of Utility-Optimal CSMA," http://arxiv.org/abs/0902.1996.
14. P. Diaconis and D. Strook, "Geometric bounds for eigenvalues of Markov chains," Annals of Applied Probability, 1 (1991), pp. 36-61.
15. H. Robbins and S. Monro, "A Stochastic Approximation Method," Annals of Mathematical Statistics, vol.22, no.3, 400-407. Sep. 1951.
16. J. Zhang, D. Zheng, and M. Chiang, "The impact of stochastic noisy feedback on distributed network utility maximization," IEEE Transactions on Information Theory, vol.54, no.2, pp. 645-665, Feb. 2008.
17. L. Jiang, D. Shah, J. Shin, J. Walrand, "Distributed Random Access Algorithm: Scheduling and Congesion Control," http://arxiv.org/abs/0907. 1266