2017/02/22 by Peruru Subrahmanya Swamy, Venkata Pavan Kumar Bellam, Swamy, Peruru Subrahmanya +5
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.IT #cs.NI #math.IT
paper · pdf · doi:10.48550/arxiv.1702.06772
Submitted to IEEE Transactions on Mobile Computing
arxiv created 2017/02/22 · arxiv updated 2017/02/23
CSMA (Carrier Sense Multiple Access) algorithms based on Gibbs sampling can achieve throughput optimality if certain parameters called the fugacities are appropriately chosen. However, the problem of computing these fugacities is NP-hard. In this work, we derive estimates of the fugacities by using a framework called the regional free energy approximations. In particular, we derive explicit expressions for approximate fugacities corresponding to any feasible service rate vector. We further prove that our approximate fugacities are exact for the class of chordal graphs. A distinguishing feature of our work is that the regional approximations that we propose are tailored to conflict graphs with small cycles, which is a typical characteristic of wireless networks. Numerical results indicate that the fugacities obtained by the proposed method are quite accurate and significantly outperform the existing Bethe approximation based techniques.