Convergence and tradeoff of utility-optimal CSMA

Jiaping Liu, Yung Yi, Alexandre Proutière, Mung Chiang, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

It has been recently suggested by Jiang and Walrand that adaptive carrier sense multiple access (CSMA) can achieve optimal utility without any message passing in wireless networks. In this paper, a generalization of this algorithm is considered. In the continuous-time model, a proof is presented of the convergence of these adaptive CSMA algorithms to arbitrarily close to utility optimality, without assuming that the network dynamics freeze while the CSMA parameters are updated. In the more realistic, slotted-time model, the impact of collisions on the utility achieved is characterized, and the tradeoff between optimality at equilibrium and short-term fairness is quantified.

Original languageEnglish (US)
Title of host publicationProceedings of the 2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009
DOIs
StatePublished - 2009
Event2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009 - Madrid, Spain
Duration: Sep 14 2009Sep 16 2009

Publication series

NameProceedings of the 2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009

Other

Other2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009
CountrySpain
CityMadrid
Period9/14/099/16/09

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

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

Cite this