Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

In-network approximate computation of outliers with quality guarantees

Giatrakos Nikolaos, Kotidis, Ioannis, Deligiannakis Antonios, Vassalos, Vasilis, Theodoridis, Yannis, 1967-

Full record


URI: http://purl.tuc.gr/dl/dias/05CFD94D-060C-4210-8DC9-FFED71690166
Year 2013
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation N. Giatrakos, Y. Kotidis, A. Deligiannakis, V. Vassalos and Y. Theodoridis, "In-network approximate computation of outliers with quality guarantees," Inform. Syst., vol. 38, no. 8, pp. 1285-1308, Nov. 2013. doi:10.1016/j.is.2011.08.005 https://doi.org/10.1016/j.is.2011.08.005
Appears in Collections

Summary

Wireless sensor networks are becoming increasingly popular for a variety of applications. Users are frequently faced with the surprising discovery that readings produced by the sensing elements of their motes are often contaminated with outliers. Outlier readings can severely affect applications that rely on timely and reliable sensory data in order to provide the desired functionality. As a consequence, there is a recent trend to explore how techniques that identify outlier values based on their similarity to other readings in the network can be applied to sensory data cleaning. Unfortunately, most of these approaches incur an overwhelming communication overhead, which limits their practicality. In this paper we introduce an in-network outlier detection framework, based on locality sensitive hashing, extended with a novel boosting process as well as efficient load balancing and comparison pruning mechanisms. Our method trades off bandwidth for accuracy in a straightforward manner and supports many intuitive similarity metrics. Our experiments demonstrate that our framework can reliably identify outlier readings using a fraction of the bandwidth and energy that would otherwise be required.

Services

Statistics