On the design of efficient CSMA algorithms for wireless networks

J. Ghaderi, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Rajagopalan, Shah, and Shin (2009) shows that, if the link weights are chosen to be of the form log log(q) (where q is the queue-length), then throughput optimality is achieved. In this paper, we tighten their result by showing that throughput optimality is preserved even with weight functions of the form log(q)/g(q), where g(q) can be a function that increases arbitrarily slowly. The significance of the result is due to the fact that weight functions of the form log(q)/g(q) seem to achieve the best delay performance in practice.

Original languageEnglish (US)
Title of host publication2010 49th IEEE Conference on Decision and Control, CDC 2010
Pages954-959
Number of pages6
DOIs
StatePublished - Dec 1 2010
Event2010 49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, GA, United States
Duration: Dec 15 2010Dec 17 2010

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other2010 49th IEEE Conference on Decision and Control, CDC 2010
CountryUnited States
CityAtlanta, GA
Period12/15/1012/17/10

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'On the design of efficient CSMA algorithms for wireless networks'. Together they form a unique fingerprint.

  • Cite this

    Ghaderi, J., & Srikant, R. (2010). On the design of efficient CSMA algorithms for wireless networks. In 2010 49th IEEE Conference on Decision and Control, CDC 2010 (pp. 954-959). [5717965] (Proceedings of the IEEE Conference on Decision and Control). https://doi.org/10.1109/CDC.2010.5717965