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
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
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 -