A randomised Kaczmarz method-based matrix completion algorithm for data collection in wireless sensor networks

Abstract

The paper proposes a novel matrix completion algorithm for data collection in wireless sensor networks through incorporating a randomised version of Kaczmarz method. By splitting the matrix completion problem into two convex sub-problems and solving the optimal probability computing problem in the randomised Kaczmarz method approximately with the D-optimal design solution, we reduce the reconstruction error and accelerate the convergence speed of the matrix completion computation. The synthetic data experiments show that the proposed algorithm presents more accurate reconstruction accuracy and faster reconstruction speed than the state-of-the-art matrix completion algorithms. Furthermore, we verify the practicality of the proposed matrix completion algorithm in real data collection scenario of wireless sensor networks through the experiments based on the real sensed dataset.