Convergence and Tradeoff of Utility-Optimal CSMA
Information Theory
2016-11-18 v1 math.IT
Abstract
It has been recently suggested that in wireless networks, CSMA-based distributed MAC algorithms could achieve optimal utility without any message passing. We present the first proof of convergence of such adaptive CSMA algorithms towards an arbitrarily tight approximation of utility-optimizing schedule. We also briefly discuss the tradeoff between optimality at equilibrium and short-term fairness practically achieved by such algorithms.
Cite
@article{arxiv.0902.1996,
title = {Convergence and Tradeoff of Utility-Optimal CSMA},
author = {Jiaping Liu and Yung Yi and Alexandre Proutiere and Mung Chiang and H. Vincent Poor},
journal= {arXiv preprint arXiv:0902.1996},
year = {2016}
}
Comments
6 pages, 1 figure, submitted to IEEE Communications Letters