Mobility

Applications of Belief Propagation in CSMA Wireless Networks

Download Now Free registration required

Executive Summary

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.

  • Format: PDF
  • Size: 573.76 KB