Towards utility-optimal random access without message passing

Cited 55 time in webofscience Cited 0 time in scopus
  • Hit : 375
  • Download : 0
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 (C) 2009 John Wiley & Sons, Ltd.
Publisher
WILEY-HINDAWI
Issue Date
2010-01
Language
English
Article Type
Article
Citation

WIRELESS COMMUNICATIONS & MOBILE COMPUTING, v.10, no.1, pp.115 - 128

ISSN
1530-8669
DOI
10.1002/wcm.897
URI
http://hdl.handle.net/10203/98442
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 55 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0