A Pattern-based Query Strategy in Wireless Sensor Network

• Yanhong Ding,
• Tie Qiu,
• He Jiang,
• Weifeng Sun,

Vol. 6, No. 6, June 25, 2012
10.3837/tiis.2012.06.004, Download Paper (Free):

• Pattern query
• Wireless Sensor Network
• piecewise linear representation

Abstract

Pattern-based query processing has not attracted much attention in wireless sensor network though its counterpart has been studied extensively in data stream. The methods used for data stream usually consume large memory and much energy. This conflicts with the fact that wireless sensor networks are heavily constrained by their hardware resources. In this paper, we use piece wise representation to represent sensor nodes’ collected data to save sensor nodes’ memory and to reduce the energy consumption for query. After getting data stream’s and patterns’ approximated line segments, we record each line’s slope. We do similar matching on slope sequences. We compute the dynamic time warping distance between slope sequences. If the distance is less than user defined threshold, we say that the subsequence is similar to the pattern. We do experiments on STM32W108 processor to evaluate our strategy’s performance compared with na_ve method. The results show that our strategy’s matching precision is less than that of na_ve method, but our method’s energy consumption is much better than that of na_ve approach. The strategy proposed in this paper can be used in wireless sensor network to process pattern-based queries.

Statistics

Cite this article