CSMA Using the Bethe Approximation: Scheduling and Utility Maximization

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 384
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorYun, Se-Youngko
dc.contributor.authorShin, Jinwooko
dc.contributor.authorYi, Yungko
dc.date.accessioned2016-04-15T03:02:12Z-
dc.date.available2016-04-15T03:02:12Z-
dc.date.created2015-09-14-
dc.date.created2015-09-14-
dc.date.issued2015-09-
dc.identifier.citationIEEE TRANSACTIONS ON INFORMATION THEORY, v.61, no.9, pp.4776 - 4787-
dc.identifier.issn0018-9448-
dc.identifier.urihttp://hdl.handle.net/10203/203912-
dc.description.abstractCarrier sense multiple access (CSMA), which resolves contentions over wireless networks in a fully distributed fashion, has recently gained a lot of attentions since it has been proved that appropriate control of CSMA parameters guarantees optimality in terms of stability (i.e., scheduling) and system-wide utility (i.e., scheduling and congestion control). Most CSMA-based algorithms rely on the popular Markov chain Monte Carlo technique, which enables one to find optimal CSMA parameters through iterative loops of simulation-and-update. However, such a simulation-based approach often becomes a major cause of exponentially slow convergence, being poorly adaptive to flow/topology changes. In this paper, we develop distributed iterative algorithms which produce approximate solutions with convergence in polynomial time for both stability and utility maximization problems. In particular, for the stability problem, the proposed distributed algorithm requires, somewhat surprisingly, only one iteration among links. Our approach is motivated by the Bethe approximation (introduced by Yedidia, Freeman, and Weiss) allowing us to express approximate solutions via a certain nonlinear system with polynomial size. Our polynomial convergence guarantee comes from directly solving the nonlinear system in a distributed manner, rather than multiple simulation-and-update loops in existing algorithms. We provide numerical results to show that the algorithm produces highly accurate solutions and converges much faster than the prior ones.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.subjectOPTIMAL RANDOM-ACCESS-
dc.subjectBELIEF PROPAGATION-
dc.subjectCONGESTION CONTROL-
dc.subjectWIRELESS NETWORKS-
dc.subjectDELAY-
dc.subjectTHROUGHPUT-
dc.titleCSMA Using the Bethe Approximation: Scheduling and Utility Maximization-
dc.typeArticle-
dc.identifier.wosid000360015900015-
dc.identifier.scopusid2-s2.0-84939838783-
dc.type.rimsART-
dc.citation.volume61-
dc.citation.issue9-
dc.citation.beginningpage4776-
dc.citation.endingpage4787-
dc.citation.publicationnameIEEE TRANSACTIONS ON INFORMATION THEORY-
dc.identifier.doi10.1109/TIT.2015.2439251-
dc.contributor.localauthorYun, Se-Young-
dc.contributor.localauthorShin, Jinwoo-
dc.contributor.localauthorYi, Yung-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorCSMA-
dc.subject.keywordAuthorBethe approximation-
dc.subject.keywordAuthorwireless ad-hoc network-
dc.subject.keywordPlusOPTIMAL RANDOM-ACCESS-
dc.subject.keywordPlusBELIEF PROPAGATION-
dc.subject.keywordPlusCONGESTION CONTROL-
dc.subject.keywordPlusWIRELESS NETWORKS-
dc.subject.keywordPlusDELAY-
dc.subject.keywordPlusTHROUGHPUT-
Appears in Collection
IE-Journal Papers(저널논문)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 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0