Partial Matrix Completion Algorithm for Efficient Data Gathering in Wireless Sensor Networks

Kefu Yi

doi:10.1109/LCOMM.2014.2371998

Return

Partial Matrix Completion Algorithm for Efficient Data Gathering in Wireless Sensor Networks

2015-01-01

PRE

DOI：10.1109/LCOMM.2014.2371998

Original

Original request for help

Save

Abstract

En 中文

To enable efficient data gathering in wireless sensor networks, a novel partial matrix completion algorithm is proposed by introducing historical data to the original data matrix. The recovery accuracy is further improved by making full use of the band-limited feature of the sensory data. We analyzed the recovery error of the proposed algorithm and derived a theoretical error upper bound. Experimental results on two real-world data sets show that the proposed algorithm achieves good recovery accuracy even when the sampling ratio is very low, which outperforms the state-of-the-art methods.

Keywords:

Discrete Cosine Transform

data gathering

matrix completion

wireless sensor networks

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.