Abstract
The typical nodes used in mote-level wireless sensor networks (WSNs) are often brittle and severely resource-constrained. In particular, nodes are often battery-powered, thereby making energy depletion a significant risk. When changes to the connectivity graph occur as a result of node failure, the overall computation may collapse unless it is capable of adapting to the new WSN state. Sensor network query processors (SNQPs) construe a WSN as a distributed, continuous query platform where the streams of sensed values constitute the logical extents of interest. Crucially, in the context of this paper, they must make assumptions about the connectivity graph of the WSN at compile time that are likely not to hold for the lifetime of the compiled query evaluation plans (QEPs) the SNQPs generate. This paper address the problem of ensuring that a QEP continues to execute even if some nodes fail. The goal is to extend the lifetime of the QEP, i.e., the period during which it produces results, beyond the point where node failures start to occur. We contribute descriptions of two different approaches that have been implemented in an existing SNQP and present experimental results indicating that each significantly increases the overall lifetime of a query compared with non adaptive approach. © 2013 Springer-Verlag.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
Pages | 33-47 |
Number of pages | 14 |
Volume | 7968 |
DOIs | |
Publication status | Published - 2013 |
Event | 29th British National Conference on Databases, BNCOD 2013 - Oxford Duration: 1 Jul 2013 → … |
Conference
Conference | 29th British National Conference on Databases, BNCOD 2013 |
---|---|
City | Oxford |
Period | 1/07/13 → … |
Keywords
- Resilience
- Sensor Network Query Processors
- Wireless Sensor Networks