CSMA using the Bethe approximation for utility maximization
2013 (English)In: IEEE International Symposium on Information Theory: Proceedings, IEEE conference proceedings, 2013, 206-210 p.Conference paper (Refereed)
CSMA (Carrier Sense Multiple Access), 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 system-wide utility. Most algorithms rely on the popular MCMC (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 a distributed iterative algorithm which produces approximate solutions with convergence in polynomial time. Our approach is motivated by a scheme in statistical physics, referred to as the Bethe approximation, allowing us to express approximate solutions via a certain non-linear system with polynomial size. We provide numerical results to show that the algorithm produces highly accurate solutions and converges much faster than prior ones.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 206-210 p.
, IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-139139DOI: 10.1109/ISIT.2013.6620217ISI: 000348913400042ScopusID: 2-s2.0-84890336634ISBN: 9781479904464OAI: oai:DiVA.org:kth-139139DiVA: diva2:685253
2013 IEEE International Symposium on Information Theory, ISIT 2013; Istanbul, Turkey, 7-12 July 2013
QC 201401092014-01-092014-01-072015-12-04Bibliographically approved