DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yun, Se-Young | ko |
dc.contributor.author | Shin, Jinwoo | ko |
dc.contributor.author | Yi, Yung | ko |
dc.date.accessioned | 2016-04-15T03:02:12Z | - |
dc.date.available | 2016-04-15T03:02:12Z | - |
dc.date.created | 2015-09-14 | - |
dc.date.created | 2015-09-14 | - |
dc.date.created | 2015-09-14 | - |
dc.date.issued | 2015-09 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.61, no.9, pp.4776 - 4787 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | http://hdl.handle.net/10203/203912 | - |
dc.description.abstract | Carrier 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.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | OPTIMAL RANDOM-ACCESS | - |
dc.subject | BELIEF PROPAGATION | - |
dc.subject | CONGESTION CONTROL | - |
dc.subject | WIRELESS NETWORKS | - |
dc.subject | DELAY | - |
dc.subject | THROUGHPUT | - |
dc.title | CSMA Using the Bethe Approximation: Scheduling and Utility Maximization | - |
dc.type | Article | - |
dc.identifier.wosid | 000360015900015 | - |
dc.identifier.scopusid | 2-s2.0-84939838783 | - |
dc.type.rims | ART | - |
dc.citation.volume | 61 | - |
dc.citation.issue | 9 | - |
dc.citation.beginningpage | 4776 | - |
dc.citation.endingpage | 4787 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.identifier.doi | 10.1109/TIT.2015.2439251 | - |
dc.contributor.localauthor | Yun, Se-Young | - |
dc.contributor.localauthor | Shin, Jinwoo | - |
dc.contributor.localauthor | Yi, Yung | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | CSMA | - |
dc.subject.keywordAuthor | Bethe approximation | - |
dc.subject.keywordAuthor | wireless ad-hoc network | - |
dc.subject.keywordPlus | OPTIMAL RANDOM-ACCESS | - |
dc.subject.keywordPlus | BELIEF PROPAGATION | - |
dc.subject.keywordPlus | CONGESTION CONTROL | - |
dc.subject.keywordPlus | WIRELESS NETWORKS | - |
dc.subject.keywordPlus | DELAY | - |
dc.subject.keywordPlus | THROUGHPUT | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.