Parallel processing of data from very large-scale wireless sensor networks
Authors:
Open Access
- 21 June 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 787-794
Abstract
In this paper we explore the problems of storing and reasoning about data collected from very large-scale wireless sensor networks (WSNs). Potential worldwide deployment of WSNs for, e.g., environmental monitoring purposes could yield data in amounts of petabytes each year. Distributed database solutions such as BigTable and Hadoop are capable of dealing with storage of such amounts of data. However, it is far from clear whether the associated MapReduce programming model is suitable for processing of sensor data. This is because typical applications MapReduce is used for, currently are relational in nature, whereas for sensing data one is usually interested in spatial structure of data instead. We show that MapReduce can indeed be used to develop such applications, and also describe in detail a general architecture for service platform for storing and processing of data obtained from massive WSNs.Keywords
This publication has 13 references indexed in Scilit:
- Design of large-scale agricultural wireless sensor networks: email from the vineyardInternational Journal of Sensor Networks, 2010
- Sensor Networks Motes, Smart Spaces, and BeyondIEEE Pervasive Computing, 2009
- A vehicle for research2009
- Experiences on Processing Spatial Data with MapReduce2009
- Investigative Queries in Sensor NetworksLecture Notes in Computer Science, 2007
- Implementation and performance evaluation of nanoMAC: a low-power MAC solution for high density wireless sensor networksInternational Journal of Sensor Networks, 2007
- Routing techniques in wireless sensor networks: a surveyIEEE Wireless Communications, 2004
- DB2 Parallel EditionIBM Systems Journal, 1995
- A bridging model for parallel computationCommunications of the ACM, 1990
- Multidimensional divide-and-conquerCommunications of the ACM, 1980