Computer Science – Information Theory
Scientific paper
2009-02-12
Computer Science
Information Theory
6 pages, 1 figure, submitted to IEEE Communications Letters
Scientific paper
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.
Chiang Mung
Liu Jiaping
Poor Harold Vincent
Proutiere Alexandre
Yi Yung
No associations
LandOfFree
Convergence and Tradeoff of Utility-Optimal CSMA does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Convergence and Tradeoff of Utility-Optimal CSMA, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence and Tradeoff of Utility-Optimal CSMA will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-356721