Distributed, simple and stable network localization
Published in 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2014
We propose a simple, stable and distributed algorithm which directly optimizes the nonconvex maximum likelihood criterion for sensor network localization, with no need to tune any free parameter. We reformulate the problem to obtain a gradient Lipschitz cost; by shifting to this cost function we enable a Majorization-Minimization (MM) approach based on quadratic upper bounds that decouple across nodes; the resulting algorithm happens to be.
Recommended citation: Claudia Soares, Joao Xavier, Joao Gomes, "Distributed, simple and stable network localization." 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2014. http://dx.doi.org/10.1109/globalsip.2014.7032222
