Hyperplane-based vector quantization for distributed estimation in wireless sensor networks

  • Authors:
  • Jun Fang;Hongbin Li

  • Affiliations:
  • Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ;Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.84

Visualization

Abstract

This paper considers distributed estimation of a vector parameter in the presence of zero-mean additive multivariate Gaussian noise in wireless sensor networks. Due to stringent power and bandwidth constraints, vector quantization is performed at each sensor to convert its local noisy vector observation into one bit of information, which is then forwarded to a fusion center where a final estimate of the vector parameter is obtained. Within such a context, this paper focuses on a class of hyperplane-based vector quantizers which linearly convert the observation vector into a scalar by using a compression vector and then carry out a scalar quantization. It is shown that the key of the vector quantization design is to find a compression vector for each sensor. Under the framework of the Cramér-Rao bound (CRB) analysis, the compression vector design problem is formulated as an optimization problem that minimizes the trace of the CRB matrix. Such an optimization problem is extensively studied. In particular, an efficient iterative algorithm is developed for the general case, along with optimal and near-optimal solutions for some specific but important noise scenarios. Performance analysis and simulation results are carried out to illustrate the effectiveness of the proposed scheme.