Implementing utility-optimal CSMA

Jinsung Lee; Junhee Lee; Yung Yi; Song Chong; Alexandre Proutière; Mung Chiang

doi:10.1109/ALLERTON.2009.5394849

Implementing utility-optimal CSMA

Jinsung Lee, Junhee Lee, Yung Yi, Song Chong, Alexandre Proutière, Mung Chiang

Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

23 Scopus citations

Abstract

Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first deployment of such random access algorithms through an implementation over conventional 802.11 hardware, an on-going effort that started in summer 2009. It shows both a confirmation that Utility Optimal CSMA may work well in practice even with an implementation over legacy equipment, and a wide array of gaps between theory and practice in the field of wireless scheduling. This paper therefore also brainstorms the discovery of and bridging over these gaps, and the implementation-inspired questions on modeling and analysis of scheduling algorithms.

Original language	English (US)
Title of host publication	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages	102-111
Number of pages	10
DOIs	https://doi.org/10.1109/ALLERTON.2009.5394849
State	Published - Dec 1 2009
Event	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States Duration: Sep 30 2009 → Oct 2 2009

Publication series

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

Other

Other	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Country	United States
City	Monticello, IL
Period	9/30/09 → 10/2/09

All Science Journal Classification (ASJC) codes

Computer Science(all)
Control and Systems Engineering
Communication

Keywords

802.11
CSMA
Distributed algorithm
Optimization
Random access
Scheduling
Systems
Wireless networks

Access to Document

10.1109/ALLERTON.2009.5394849

Fingerprint Dive into the research topics of 'Implementing utility-optimal CSMA'. Together they form a unique fingerprint.

Cite this

Lee, J., Lee, J., Yi, Y., Chong, S., Proutière, A., & Chiang, M. (2009). Implementing utility-optimal CSMA. In 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 (pp. 102-111). [5394849] (2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009). https://doi.org/10.1109/ALLERTON.2009.5394849

@inproceedings{6c7fe2963b814be3b5dd20781f2bb6ec,

title = "Implementing utility-optimal CSMA",

abstract = "Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first deployment of such random access algorithms through an implementation over conventional 802.11 hardware, an on-going effort that started in summer 2009. It shows both a confirmation that Utility Optimal CSMA may work well in practice even with an implementation over legacy equipment, and a wide array of gaps between theory and practice in the field of wireless scheduling. This paper therefore also brainstorms the discovery of and bridging over these gaps, and the implementation-inspired questions on modeling and analysis of scheduling algorithms.",

keywords = "802.11, CSMA, Distributed algorithm, Optimization, Random access, Scheduling, Systems, Wireless networks",

author = "Jinsung Lee and Junhee Lee and Yung Yi and Song Chong and Alexandre Prouti{\`e}re and Mung Chiang",

year = "2009",

month = dec,

day = "1",

doi = "10.1109/ALLERTON.2009.5394849",

language = "English (US)",

isbn = "9781424458714",

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

pages = "102--111",

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

note = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 ; Conference date: 30-09-2009 Through 02-10-2009",

}

Lee, J, Lee, J, Yi, Y, Chong, S, Proutière, A & Chiang, M 2009, Implementing utility-optimal CSMA. in 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009., 5394849, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, pp. 102-111, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, United States, 9/30/09. https://doi.org/10.1109/ALLERTON.2009.5394849

Implementing utility-optimal CSMA. / Lee, Jinsung; Lee, Junhee; Yi, Yung; Chong, Song; Proutière, Alexandre; Chiang, Mung.

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009. 2009. p. 102-111 5394849 (2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Implementing utility-optimal CSMA

AU - Lee, Jinsung

AU - Lee, Junhee

AU - Yi, Yung

AU - Chong, Song

AU - Proutière, Alexandre

AU - Chiang, Mung

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first deployment of such random access algorithms through an implementation over conventional 802.11 hardware, an on-going effort that started in summer 2009. It shows both a confirmation that Utility Optimal CSMA may work well in practice even with an implementation over legacy equipment, and a wide array of gaps between theory and practice in the field of wireless scheduling. This paper therefore also brainstorms the discovery of and bridging over these gaps, and the implementation-inspired questions on modeling and analysis of scheduling algorithms.

AB - Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first deployment of such random access algorithms through an implementation over conventional 802.11 hardware, an on-going effort that started in summer 2009. It shows both a confirmation that Utility Optimal CSMA may work well in practice even with an implementation over legacy equipment, and a wide array of gaps between theory and practice in the field of wireless scheduling. This paper therefore also brainstorms the discovery of and bridging over these gaps, and the implementation-inspired questions on modeling and analysis of scheduling algorithms.

KW - 802.11

KW - CSMA

KW - Distributed algorithm

KW - Optimization

KW - Random access

KW - Scheduling

KW - Systems

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=77949639042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949639042&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2009.5394849

DO - 10.1109/ALLERTON.2009.5394849

M3 - Conference contribution

AN - SCOPUS:77949639042

SN - 9781424458714

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

SP - 102

EP - 111

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

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

Y2 - 30 September 2009 through 2 October 2009

ER -