Post-processing in wireless sensor networks: benchmarking sensor trace files

Authors:
Martin C. Bor;Ioannis Chatzigiannakis;Stefan O. Dulman;Panagiotis Kikiras;Evangelos Theodoridis;Otto W. Visser
Affiliations:
Delft University of Technology, Delft, Netherlands;Research Academic Computer Technology Institute, Patras, Greece;Delft University of Technology, Delft, Netherlands;University of Thessaly, Volos, Greece;Research Academic Computer Technology Institute, Patras, Greece;Delft University of Technology, Delft, Netherlands
Venue:
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2010

Citing 5
Cited 0

Probabilistic counting algorithms for data base applications

Journal of Computer and System Sciences
In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Time-decaying sketches for sensor data aggregation

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Synopsis diffusion for robust aggregation in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Murphy loves potatoes: experiences from a pilot sensor network deployment in precision agriculture

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor network research usually focuses on the reliable and efficient collection of data. Here, we address the next step in the traces lifetime: we aim at investigating and evaluating, by qualitative and quantitative means, data repositories of already collected measurements. We propose the use of a set of new metrics, which enable reliable evaluation of algorithms using traces (both in average cases and "stressful" setups) removing the need for running algorithms in a real testbed, at least in the development stage.