Fuzzy modeling for data cleaning in sensor networks
International Journal of Hybrid Intelligent Systems - Recent Advances in Intelligent Paradigms Fusion and Their Applications
Robust preprocessing for health care monitoring framework
Healthcom'09 Proceedings of the 11th international conference on e-Health networking, applications and services
TACO: tunable approximate computation of outliers in wireless sensor networks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
PAO: power-efficient attribution of outliers in wireless sensor networks
Proceedings of the Seventh International Workshop on Data Management for Sensor Networks
Hierarchical querying scheme of human motions for smart home environment
Engineering Applications of Artificial Intelligence
A dual hybrid forecasting model for support of decision making in healthcare management
Advances in Engineering Software
Middleware for pervasive computing: A survey
Pervasive and Mobile Computing
System-level calibration for data fusion in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
In-network approximate computation of outliers with quality guarantees
Information Systems
DARGOS: A highly adaptable and scalable monitoring architecture for multi-tenant Clouds
Future Generation Computer Systems
| Hi-index | 0.00 |
Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environments, however, it is well known that the collected sensor data are noisy. Therefore, it is very critical to clean the sensor data before using them to answer queries or conduct data analysis. Popular data cleaning approaches, such as the moving average, cannot meet the requirements of both energy efficiency and quick response time in many sensor related applications. In this paper, we propose a hybrid sensor data cleaning approach with confidence. Specifically, we propose a smart weighted moving average (WMA) algorithm that collects confidence data from sensors and computes the weighted moving average. The rationale behind the WMA algorithm is to draw more samples for a particular value that is of great importance to the moving average, and provide higher confidence weight for this value, such that this important value can be quickly reflected in the moving average. Based on our extensive simulation results, we demonstrate that, compared to the simple moving average (SMA), our WMA approach can effectively clean data and offer quick response time.