Design of scalable decoders for sensor networks via Bayesian network learning

  • Authors:
  • Ruchira Yasaratna;Pradeepa Yahampath

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada;Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Minimum mean square error (MMSE) decoding in a large-scale sensor network which employs distributed quantization is considered. Given that the computational complexity of the optimal decoder is exponential in the network size, we present a framework based on Bayesian networks for designing a near-optimal decoder whose complexity is only linear in network size (hence scalable). In this approach, a complexity-constrained factor graph, which approximately represents the prior joint distribution of the sensor outputs, is obtained by constructing an equivalent Bayesian network using the maximum likelihood (ML) criterion. The decoder executes the sum-product algorithm on the simplified factor graph. Our simulation results have shown that the scalable decoders constructed using the proposed approach perform close to optimal, with both Gaussian and non-Gaussian sensor data.