DocumentCode
3089588
Title
[Epsilon] -- DjC: A Disjoint Clique Approach for Data Driven Approximate Bounded Loss Data Collection in Sensor Networks
Author
Gupta, Himanshu ; Agarwal, Manoj K.
Author_Institution
Res. Lab., IBM, New Delhi, India
fYear
2011
fDate
25-27 July 2011
Firstpage
205
Lastpage
214
Abstract
In this paper we present a data-driven approach for the problem of approximate data collection in sensor networks within the disjoint clique framework. The objective is to obtain estimations of attribute values from sensor nodes within certain error bounds while spending minimal amount of energy. Chu et al. [3] showed that a disjoint clique model is a natural and effective way of exploiting temporal and spatial correlations in the attribute values. However their approach assumes the prior knowledge of probabilistic models representing the sensor data. This often seems to be a tedious task in real world deployments. This paper presents a data driven solution using disjoint clique model which does not assume any such prior knowledge. Using a preliminary experimental evaluation on a real life and a synthetic dataset, we show that the proposed data driven approach is feasible and is easy to deploy.
Keywords
wireless sensor networks; data driven approximate bounded loss data collection; disjoint clique model; probabilistic models; sensor nodes; wireless sensor network; Base stations; Computational modeling; Correlation; Data models; Probabilistic logic; Upper bound; Wireless sensor networks; Data-driven/Model-driven; Energy Minimization; Sensor Network;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS), 2011 IEEE 19th International Symposium on
Conference_Location
Singapore
ISSN
1526-7539
Print_ISBN
978-1-4577-0468-0
Type
conf
DOI
10.1109/MASCOTS.2011.22
Filename
6005362
Link To Document