Towards utility-optimal random access without message passing

J. Liu, Y. Yi, A. Proutiere, Mung Chiang, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

68 Scopus citations


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, after a survey of recent work on random access, 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 be arbitrarily close to utility optimality, without assuming that the network dynamics converge to an equilibrium in between consecutive CSMA parameter updates. In the more realistic, slotted-time model, the impact of collisions on the utility achieved is characterized, and the tradeoff between optimality and short-term fairness is quantified.

Original languageEnglish (US)
Pages (from-to)115-128
Number of pages14
JournalWireless Communications and Mobile Computing
Issue number1
StatePublished - Jan 2010

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


  • CSMA
  • Distributed control
  • Network utility maximization
  • Optimization
  • Random access
  • Scheduling
  • Stochastic network
  • Wireless network


Dive into the research topics of 'Towards utility-optimal random access without message passing'. Together they form a unique fingerprint.

Cite this