Abstract
Reliable data delivery in the Internet of Things (IoT) is very important in order to provide IoT-based services with the required quality. However, IoT data delivery may not be successful for different reasons, such as connection errors, external attacks, or sensing errors. This results in data incompleteness, which decreases the performance of IoT applications. In particular, the recovery of missing data among the massive sensed data of the IoT is so important that it should be solved. In this paper, we propose a probabilistic method to recover missing (incomplete) data from IoT sensors by utilizing data from related sensors. The main idea of the proposed method is to perform probabilistic matrix factorization (PMF) within the preliminary assigned group of sensors. Unlike previous PMF approaches, the proposed model measures the similarity in data among neighboring sensors and splits them into different clusters with a K-means algorithm. Simulation results show that the proposed PMF model with clustering outperforms support vector machine (SVM) and deep neural network (DNN) algorithms in terms of accuracy and root mean square error. By using normalized datasets, PMF shows faster execution time than SVM, and almost the same execution time as the DNN method. This proposed incomplete data-recovery approach is a promising alternative to traditional DNN and SVM methods for IoT telemetry applications.
Original language | English |
---|---|
Pages (from-to) | 2282-2292 |
Number of pages | 11 |
Journal | IEEE Internet of Things Journal |
Volume | 5 |
Issue number | 4 |
DOIs | |
Publication status | Published - Aug 2018 |
Keywords
- Clustering algorithms
- Internet of Things
- Internet of Things (IoT)
- massive sensed data.
- Probabilistic logic
- probabilistic matrix factorization
- recovery of missing sensor data
- Sensor systems
- Support vector machines
- Wireless sensor networks