Title :
Design of scalable decoders for sensor networks via Bayesian network learning
Author :
Yasaratna, Ruchira ; Yahampath, Pradeepa
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Manitoba, Winnipeg, MB, Canada
fDate :
10/1/2009 12:00:00 AM
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.
Keywords :
belief networks; computational complexity; graph theory; least mean squares methods; maximum likelihood decoding; wireless sensor networks; Bayesian network learning; Gaussian sensor data; MMSE decoding; complexity-constrained factor graph; computational complexity; distributed quantization; maximum likelihood criterion; minimum mean square error decoding; nonGaussian sensor data; scalable decoders; sensor networks; sum-product algorithm; Bayesian methods; Bit rate; Large-scale systems; Maximum likelihood decoding; Mean square error methods; Probability distribution; Quantization; Source coding; Sum product algorithm; Wireless sensor networks; Distributed source coding; graphical models; quantization; sensor networks; sum-product algorithm;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2009.10.080025