Curve Query Processing in Wireless Sensor Networks
Curve Query Processing in Wireless Sensor Networks
复制标题
无线传感器网络中的曲线查询处理
DOI：
10.1109/tvt.2014.2375330
复制
发表时间：
2015-11-01
影响因子：
6.8
通讯作者：
Li, Jianzhong
中科院分区：
文献类型：
--
作者：
Cheng, Siyao;Cai, Zhipeng;Li, Jianzhong
现有的无线传感器网络查询处理算法大多只能处理离散值。然而，由于被监测的环境总是随时间连续变化的，离散值不能准确地描述环境，因此可能无法满足各种查询要求，例如最大、最小和拐点的查询。因此，引入能够处理时间连续数据的新查询具有极大的意义。曲线是表示连续感知数据的一种有效方法，本文研究了无线传感器网络中的曲线查询处理。具体而言，感知曲线推导算法，以支持曲线查询处理的无线传感器网络中首次提出。然后以聚合操作为例说明曲线查询的处理过程。相应地，设计了相应的精确和近似聚集算法。我们证明了近似聚集算法的能量成本是最优的，只要满足所需的精度。理论分析和实验结果表明，本文提出的算法在准确率和能量效率方面都具有较高的性能。
Most existing query processing algorithms for wireless sensor networks (WSNs) can only deal with discrete values. However, since the monitored environment always changes continuously with time, discrete values cannot describe the environment accurately and, hence, may not satisfy a variety of query requirements, such as the queries of the maximal, minimal, and inflection points. It is, therefore, of great interest to introduce new queries capable of processing time-continuous data. This paper investigates curve query processing for WSNs as curve is an effective way to represent continuous sensed data. Specifically, a sensed curve derivation algorithm to support curve query processing in WSNs is first proposed. Then, the aggregation operation is employed as an example to illustrate curve query processing. The corresponding accurate and approximate aggregation algorithms are devised accordingly. We demonstrate that the energy cost of the approximate aggregation algorithm is optimal, provided that the required precision is satisfied. The theoretical analysis and experimental results indicate that the proposed algorithms can achieve high performance in terms of accuracy and energy efficiency.