Convergence and Tradeoff of Utility-Optimal CSMA

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-356721

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.