A New Data Cleaning and Scheduling Algorithm for Wireless Sensor Networks Based on Internet of Things

Abstract

Wireless sensor networks data cleaning and scheduling is one of the important research issues in Internet of things theory. The existing data cleaning and scheduling algorithms assume all the data can be loaded into the main memory at one-time, which are infeasible for data center. To this end, based on the Internet of things data center, a data cleaning and scheduling algorithm is proposed in wireless sensor networks. It proposes a scheduling model based on replica firstly, and then by introducing wireless sensor networks mechanisms, it presents a data-driven adaptive replica strategy by considering geographic features, network status, and application characteristics. This dissertation focuses on Internet of things data center, policy of replica, and scheduling mechanism. The experimental results show that the wireless sensor networks environment data replica and scheduling algorithm is effective and feasible, and has better expansibility.

Keywords

• Data center
• Scheduling algorithms
• Wireless sensor networks
• Data cleaning
• Internet of things.