Publication
Title
Free energy approximations for CSMA networks
Author
Abstract
In this paper we study how to estimate the back-off rates in an idealized CSMA network consisting of n links to achieve a given throughput vector using free energy approximations. More specifically, we introduce the class of region-based free energy approximations with clique belief and present a closed form expression for the back-off rates based on the zero gradient points of the free energy approximation (in terms of the conflict graph, target throughput vector and counting numbers). Next we introduce the size k(max) clique free energy approximation as a special case and derive an explicit expression for the counting numbers, as well as a recursion to compute the back-off rates. We subsequently show that the size k(max) clique approximation coincides with a Kikuchi free energy approximation and prove that it is exact on chordal conflict graphs when k(max) = n. As a by-product these results provide us with an explicit expression of a fixed point of the inverse generalized belief propagation algorithm for CSMA networks. Using numerical experiments we compare the accuracy of the novel approximation method with existing methods.
Language
English
Source (journal)
2017 IEEE 25TH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS)
Source (book)
25th IEEE International Symposium on Modeling, Analysis, and Simulation, of Computer and Telecommunication Systems (MASCOTS), SEP 20-22, 2017, Banff, CANADA
Publication
Los alamitos : Ieee computer soc , 2017
ISSN
1526-7539
ISBN
978-1-5386-2763-1
978-1-5386-2763-1
Volume/pages
(2017) , p. 121-131
ISI
000426527200013
Full text (Publisher's DOI)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 29.03.2018
Last edited 23.08.2021
To cite this reference