research-article

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. VisserAuthors Info & Claims

PE-WASUN '10: Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks

Pages 40 - 43

https://doi.org/10.1145/1868589.1868597

Published: 17 October 2010 Publication History

Get Access

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.

References

[1]

G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for sensor data aggregation. In 26th ACM Symp. on Principles of distr. comp., pages 215--224, 2007.

Digital Library

Google Scholar

[2]

M. Durand and P. Flajolet. Loglog counting of large cardinalities (extended abstract). ESA03, volume 2832 of LNCS (2003), pp. 605--617, :605--617, 2003.

Google Scholar

[3]

P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2):182--209, 1985.

Digital Library

Google Scholar

[4]

D. Goldin, R. Mardales, and G. Nagy. In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure. In 15th ACM Intl Conf. on Inf. and KM (CIKM '06), pages 347--356. ACM, 2006.

Digital Library

Google Scholar

[5]

K. Langendoen, A. Baggio, and O. Visser. Murphy loves potatoes: Experiences from a pilot sensor network deployment in precision agriculture. In 14th Int. Work. on Par. and Distr. Real-Time Systems., Apr. 2006.

Digital Library

Google Scholar

[6]

S. Nath, P. B. Gibbons, S. Seshan, and Z. Anderson. Synopsis diffusion for robust aggregation in sensor networks. ACM Trans. Sen. Netw., 4(2):1--40, 2008.

Digital Library

Google Scholar

Index Terms

Recommendations

Relay Node Placement in Wireless Sensor Networks

A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Sensor scheduling for p-percent coverage in wireless sensor networks

We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored ...
The optimization of sensor relocation in wireless mobile sensor networks

Wireless Sensor Networks (WSNs) have been an active research area these years due to their broad range of potential applications. Several research issues, which include energy-aware routing, sensor deployment problems, data aggregation, etc., have been ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PE-WASUN '10: Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks

October 2010

114 pages

ISBN:9781450302760

DOI:10.1145/1868589

General Chair:
J. J. Garcia-Luna-Aceves
University of California at Santa Cruz, USA
,
Program Chair:
Isabelle Guérin Lassous
University Lyon 1/LIP, France

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 October 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MSWiM '10

Sponsor:

SIGSIM

MSWiM '10: The 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

October 17 - 18, 2010

Bodrum, Turkey

Acceptance Rates

Overall Acceptance Rate 70 of 240 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
107
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Relay Node Placement in Wireless Sensor Networks

Sensor scheduling for p-percent coverage in wireless sensor networks

The optimization of sensor relocation in wireless mobile sensor networks