A randomised Kaczmarz method-based matrix completion algorithm for data collection in wireless sensor networks
by Ying Wang; Guorui Li; Sancheng Peng; Cong Wang; Ying Yuan
International Journal of Embedded Systems (IJES), Vol. 11, No. 4, 2019

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.

Online publication date: Fri, 19-Jul-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com