Distributed maximum likelihood estimation for sensor networks

The problem of finding the maximum likelihood estimator of a commonly observed model, based on data collected by a sensor network under power and bandwidth constraints, is considered. In particular, a case where the sensors cannot fully share their data is treated. An iterative algorithm that relaxes the requirement of sharing all the data is given. The algorithm is based on a local Fisher scoring method and an iterative information sharing procedure. The case where the sensors share sub-optimal estimates is also analyzed. The asymptotic distribution of the estimates is derived and used to provide a means of discrimination between estimates that are associated with different local maxima of the log-likelihood function. The results are validated by a simulation.

[1]  Anil K. Jain,et al.  Unsupervised Learning of Finite Mixture Models , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  G. McLachlan,et al.  The EM algorithm and extensions , 1996 .

[3]  Venugopal V. Veeravalli,et al.  Decentralized detection in sensor networks , 2003, IEEE Trans. Signal Process..

[4]  Feng Zhao,et al.  Collaborative signal and information processing in microsensor networks , 2002, IEEE Signal Processing Magazine.

[5]  Shun-ichi Amari,et al.  Parameter estimation with multiterminal data compression , 1995, IEEE Trans. Inf. Theory.

[6]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

[7]  Kannan Ramchandran,et al.  On compression for robust estimation in sensor networks , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[8]  Robert D. Nowak,et al.  Distributed EM algorithms for density estimation and clustering in sensor networks , 2003, IEEE Trans. Signal Process..