6th International ICST Conference on Broadband Communications, Networks, and Systems

Research Article

Convergence and Tradeoff of Utility-Optimal CSMA

Download476 downloads
        author={Jiaping Liu and Yung Yi and Alexandre Prouti\'{e}re and Mung Chiang and H.Vincent Poor},
        title={Convergence and Tradeoff of Utility-Optimal CSMA},
        proceedings={6th International ICST Conference on Broadband Communications, Networks, and Systems},
        keywords={Algorithm design and analysis Clocks Convergence Message passing Multiaccess communication Scheduling algorithm Simulated annealing Stability Throughput Wireless networks},
  • Jiaping Liu
    Yung Yi
    Alexandre Proutière
    Mung Chiang
    H.Vincent Poor
    Year: 2009
    Convergence and Tradeoff of Utility-Optimal CSMA
    DOI: 10.4108/ICST.BROADNETS2009.7401
Jiaping Liu1,*, Yung Yi2,*, Alexandre Proutière3,*, Mung Chiang1,*, H.Vincent Poor1,*
  • 1: Department of Electrical Engineering, Princeton University, USA
  • 2: Department of Electrical Engineering, KAIST, South Korea
  • 3: Microsoft Research, Cambridge, UK
*Contact email: jiapingl@princeton.edu, yiyung@ee.kaist.ac.kr, alexandre.proutiere@microsoft.com, chiangm@princeton.edu, poor@princeton.edu


It has been recently suggested by Jiang andWalrand 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.