Paper Info
Title
Towards utility-optimal random access without message passing
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, 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. Copyright © 2009 John Wiley & Sons, Ltd. This paper shows how random access without message passing can approach utility optimality via adaptive CSMA. After a survey of recent work on distributed scheduling, a utility-optimal CSMA is considered, together with a proof of its convergence in a continuous-time model without assuming timescale separation. The impact of collisions is studied in the more realistic slotted-time model, together with the tradeoff between optimality and short-term fairness.
Year
DOI
Venue
2010
10.1002/wcm.v10:1
Wireless Communications and Mobile Computing
Keywords
Field
DocType
message passing,optimization,scheduling,wireless network,random access,network dynamics
Convergence (routing),Wireless network,Network dynamics,Scheduling (computing),Computer science,Computer network,Throughput,Adaptive algorithm,Message passing,Distributed computing,Random access
Journal
Volume
Issue
ISSN
10
1
1530-8669
Citations 
PageRank 
References 
52
2.06
25
Authors
5
Name
Order
Citations
PageRank
Jiaping Liu11127.03
Yung Yi21557104.55
Alexandre Proutiere355840.94
Mung Chiang47303486.32
H. V. Poor5254111951.66