The Community for Technology Leaders
2009 Sixth International Conference on Broadband Communications, Networks, and Systems. Broadnets 2009 (2009)
Madrid
Sept. 14, 2009 to Sept. 16, 2009
ISSN: 2150-4903
ISBN: 978-963-9799-49-3
pp: 1-8
Jiaping Liu , Department of Electrical Engineering, Princeton University, USA
Yung Yi , Department of Electrical Engineering, KAIST, South Korea
Alexandre Proutiere , Microsoft Research, Cambridge, UK
Mung Chiang , Department of Electrical Engineering, Princeton University, USA
H. Vincent Poor , Department of Electrical Engineering, Princeton University, USA
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.
INDEX TERMS
carrier sense multiple access, message passing, radio networks
CITATION

J. Liu, Y. Yi, A. Proutiere, M. Chiang and H. V. Poor, "Convergence and tradeoff of utility-optimal CSMA," 2009 Sixth International Conference on Broadband Communications, Networks, and Systems. Broadnets 2009(BROADNETS), Madrid, 2009, pp. 1-8.
doi:10.4108/ICST.BROADNETS2009.7401
101 ms
(Ver 3.3 (11022016))