Applications of Belief Propagation in CSMA Wireless Networks

“Belief propagation” (BP) is an efficient way to solve “inference” problems in graphical models, such as Bayesian networks and Markov random fields. It has found great success in many application areas due to its simplicity, high accuracy, and distributed nature. This paper is a first attempt to apply BP algorithms in CSMA wireless networks. Compared to prior CSMA optimization algorithms such as ACSMA, which are measurement-based, BP-based algorithms are proactive and computational, without the need for network probing and traffic measurement. Consequently, BP-based algorithms are not affected by the temporal throughput fluctuations and can converge faster. Specifically, this paper explores three applications of BP. 1) We show how BP can be used to compute the throughputs of different links in the network given their access intensities, defined as the mean packet transmission time divided by the mean backoff countdown time. 2) We propose an inverse-BP algorithm to solve the reverse problem of how to set the access intensities of different links to meet their target throughputs. 3) We introduce a BP-adaptive CSMA algorithm to find the link access intensities that can achieve optimal system utility. The first two applications are NP-hard problems, and BP provides good approximations to them. The advantage of BP is that it can converge faster compared to prior algorithms like ACSMA, especially in CSMA networks with temporal throughput fluctuations. Furthermore, this paper goes beyond BP and considers a generalized version of it, GBP, to improve accuracy in networks with a loopy contention graph. The distributed implementation of GBP is nontrivial to construct. A contribution of this paper is to show that a “maximal clique” method of forming regions in GBP: 1) yields accurate results; and 2) is amenable to distributed implementation in CSMA networks, with messages passed between one-hop neighbors only. We show that both BP and GBP algorithms for all three applications can yield solutions within seconds in real operation.

[1]  Liqun Fu,et al.  Effective Carrier Sensing in CSMA Networks under Cumulative Interference , 2010, 2010 Proceedings IEEE INFOCOM.

[2]  Yair Weiss,et al.  Belief Propagation , 2012, Encyclopedia of Social Network Analysis and Mining.

[3]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[4]  Minghua Chen,et al.  Analysis of Frequency-Agile CSMA Wireless Networks , 2010, ArXiv.

[5]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[6]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[7]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[8]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[9]  John W. Fisher,et al.  Loopy Belief Propagation: Convergence and Effects of Message Errors , 2005, J. Mach. Learn. Res..

[10]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Hilbert J. Kappen,et al.  Sufficient Conditions for Convergence of the Sum–Product Algorithm , 2005, IEEE Transactions on Information Theory.

[12]  William T. Freeman,et al.  Learning Low-Level Vision , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[13]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[14]  Soung Chang Liew,et al.  Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks , 2008, IEEE Transactions on Mobile Computing.

[15]  Tom Heskes,et al.  On the Uniqueness of Loopy Belief Propagation Fixed Points , 2004, Neural Computation.

[16]  Daniela Tuninetti,et al.  Message Error Analysis of Loopy Belief Propagation for the Sum-Product Algorithm , 2010, ArXiv.

[17]  Minghua Chen,et al.  Markov Approximation for Combinatorial Network Optimization , 2013, IEEE Transactions on Information Theory.

[18]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[19]  Soung Chang Liew,et al.  Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks , 2007, 2009 IEEE International Conference on Communications.

[20]  Patrick Thiran,et al.  Border Effects, Fairness, and Phase Transition in Large Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[21]  Brahim Bensaou,et al.  Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[22]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[23]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[24]  Soung Chang Liew,et al.  Throughput Computation in CSMA Wireless Networks with Collision Effects , 2011, ArXiv.