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
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages954-959
Number of pages6
ISBN (Print)9781424477456
DOIs
StatePublished - 2010
Event49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, United States
Duration: Dec 15 2010Dec 17 2010

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference49th IEEE Conference on Decision and Control, CDC 2010
Country/TerritoryUnited States
CityAtlanta
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