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

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.

[1]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[2]  Srinivasan Seshan,et al.  Synopsis diffusion for robust aggregation in sensor networks , 2004, SenSys '04.

[3]  Lakhmi C. Jain,et al.  Network and information security: A computational intelligence approach: Special Issue of Journal of Network and Computer Applications , 2007, J. Netw. Comput. Appl..

[4]  Vagelis Hristidis,et al.  Storing semi-structured data on disk drives , 2009, TOS.

[5]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[6]  Welf Löwe,et al.  Lazy XML processing , 2002, DocEng '02.

[7]  Suman Nath,et al.  Tributaries and deltas: efficient and robust aggregation in sensor network streams , 2005, SIGMOD '05.

[8]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[9]  George Nagy,et al.  In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure , 2006, CIKM '06.

[10]  Srikanta Tirthapura,et al.  Range-Efficient Counting of Distinct Elements in a Massive Data Stream , 2007, SIAM J. Comput..

[11]  Dongyan Xu,et al.  Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[12]  Philippe Flajolet,et al.  Loglog Counting of Large Cardinalities (Extended Abstract) , 2003, ESA.

[13]  Indranil Gupta,et al.  Scalable fault-tolerant aggregation in large process groups , 2001, 2001 International Conference on Dependable Systems and Networks.

[14]  P. Flajolet,et al.  Loglog counting of large cardinalities , 2003 .

[15]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[16]  Graham Cormode,et al.  Time-decaying sketches for sensor data aggregation , 2007, PODC '07.

[17]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[18]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[19]  Mohamed A. Sharaf,et al.  Balancing energy efficiency and quality of aggregate data in sensor networks , 2004, The VLDB Journal.

[20]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[21]  Matt Welsh,et al.  CitySense: A Vision for an Urban-Scale Wireless Networking Testbed , 2007 .

[22]  Ioannis Chatzigiannakis,et al.  Post-processing in wireless sensor networks: Benchmarking sensor trace files for in-network data aggregation , 2012, J. Netw. Comput. Appl..

[23]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[24]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[25]  Koen Langendoen,et al.  Murphy loves potatoes: experiences from a pilot sensor network deployment in precision agriculture , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.