Post-processing in wireless sensor networks: Benchmarking sensor trace files for in-network data aggregation

Wireless sensor network research usually focuses on the reliable and efficient collection of data. In this paper we target on the next step in the lifetime of traces: we aim at investigating and evaluating, by qualitative and quantitative means, data repositories of already collected measurements. Concerning the collected datasets, several important topics arise like the need of exchanging traces between researchers using a common representation of the traces and the need for common classification of the traces based on a commonly agreed set of statistical characteristics for in retrospect utilization. In order to qualitatively address these issues, we propose the use of a novel set of metrics focusing on the in-network data-aggregation problem class. These metrics enable reliable evaluation of algorithms using the same benchmark traces (both in average cases and ''stressful'' setups) removing the need for running algorithms in a real testbed, at least in the initial development stage. We present the results of our research as a first approach for addressing this problem, and in order to confirm our method, we characterized several traces with the proposed metrics. We validate the metrics by predicting the performance of three data-aggregation schemes using the available traces and checking the results by actually running the algorithms.

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

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

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

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

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

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

[7]  Dongyan Xu,et al.  Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis , 2005 .

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

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

[10]  Peng Ning,et al.  Mitigating DoS attacks against broadcast authentication in wireless sensor networks , 2008, TOSN.

[11]  Srinivasan Seshan,et al.  Synopsis diffusion for robust aggregation in sensor networks , 2008, ACM Trans. Sens. Networks.

[12]  R.N. Murty,et al.  CitySense: An Urban-Scale Wireless Sensor Network and Testbed , 2008, 2008 IEEE Conference on Technologies for Homeland Security.

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

[14]  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.

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

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

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

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

[19]  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 .

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

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

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

[23]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[24]  Saurabh Ganeriwal,et al.  Aggregation in sensor networks: an energy-accuracy trade-off , 2003, Ad Hoc Networks.

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

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