Wireless Sensor Network Localization via Matrix Completion Based on Bregman Divergence.

One of the main challenges faced by wireless sensor network (WSN) localization is the positioning accuracy of the WSN node. The existing algorithms are arduous to use for dealing with the pulse noise that is universal and ineluctable in practical considerations, resulting in lower positioning accuracy. Aimed at this problem and introducing Bregman divergence, we propose in this paper a novel WSN localization algorithm via matrix completion (LBDMC). Based on the natural low-rank character of the Euclidean Distance Matrix (EDM), the problem of EDM recovery is formulated as an issue of matrix completion in a noisy environment. A regularized matrix completion model is established, smoothing the pulse noise by leveraging L 1 , 2 -norm and the multivariate function Bregman divergence is defined to solve the model to obtain the EDM estimator. Furthermore, node localization is available based on the multi-dimensional scaling (MDS) method. Multi-faceted comparison experiments with existing algorithms, under a variety of noise conditions, demonstrate the superiority of LBDMC to other algorithms regarding positioning accuracy and robustness, while ensuring high efficiency. Notably, the mean localization error of LBDMC is about ten times smaller than that of other algorithms when the sampling rate reaches a certain level, such as >30%.