Quality assurance for data acquisition in error prone WSNs

Authors:
Sunisa Chobsri;Watinee Sumalai;Wipawee Usaha
Affiliations:
School of Telecommunication Engineering, Suranaree University of Technology, Nakhon Ratchasima, Thailand;School of Telecommunication Engineering, Suranaree University of Technology, Nakhon Ratchasima, Thailand;School of Telecommunication Engineering, Suranaree University of Technology, Nakhon Ratchasima, Thailand
Venue:
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Year:
2009

Citing 4
Cited 0

A Distributed Active Sensor Selection Scheme for Wireless Sensor Networks

ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation

IEEE Transactions on Parallel and Distributed Systems
Model-driven data acquisition in sensor networks

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Nonmyopic informative path planning in spatio-temporal models

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a data acquisition scheme which supports probabilistic data quality assurance in an error-prone Wireless Sensor Network (WSN). Given a query and a statistical model of real-world data which is highly correlated, the aim of the scheme is to find a sensor selection scheme which is used to deal with inaccurate data and probabilistic guarantee on the query result. Since most sensor readings are real-valued, we formulate the data acquisition problem as a continuous-state partially observable Markov Decision Process (POMDP). To solve the continuous-state POMDP, the fitted value iteration (FVI) is applied to find a sensor selection scheme. Numerical results show that FVI can achieve high average long-term reward and provide probabilistic guarantees on the query result more often when compared to other algorithms.