Kantas, N and Singh, SS and Doucet, A (2009) Distributed maximum likelihood for self-localization in sensor networks. Technical Report. Cambridge University Engineering Department, Cambridge, UK.Full text not available from this repository.
We show that the sensor localization problem can be cast as a static parameter estimation problem for Hidden Markov Models and we develop fully decentralized versions of the Recursive Maximum Likelihood and the Expectation-Maximization algorithms to localize the network. For linear Gaussian models, our algorithms can be implemented exactly using a distributed version of the Kalman filter and a message passing algorithm to propagate the derivatives of the likelihood. In the non-linear case, a solution based on local linearization in the spirit of the Extended Kalman Filter is proposed. In numerical examples we show that the developed algorithms are able to learn the localization parameters well.
|Item Type:||Monograph (Technical Report)|
|Uncontrolled Keywords:||Distributed inference, sensor localization, recursive maximum likelihood, expectation-maximization, sensor networks|
|Divisions:||Div F > Signal Processing and Communications|
|Depositing User:||Cron Job|
|Date Deposited:||07 Mar 2014 12:27|
|Last Modified:||10 Mar 2014 16:33|
Actions (login required)