无线传感器网络不确定数据PT-Top k查询处理技术

在无线传感器网络现实应用中,感知数据普遍存在不确定性。由于不确定数据引入了概率维度,使得不确定数据查询种类更加丰富,同时也给查询处理带来困难。不确定数据Top-k查询是一个典型的不确定数据查询任务。考虑到无线传感器网络查询处理技术对查询响应时间和网络通信消耗的高要求,研究了面向层次聚簇结构的无线传感器网络不确定数据Top-k查询处理技术。通过分析不确定数据特点,基于x-tuple规则元组模型,采用簇内与簇间的两阶段数据查询处理机制,提出了基于Poisson分布的分布式不确定数据PT-Top k查询处理近似算法TPQP。通过实验,从总体通信消耗、与概率阈值p相关分析、与排序数k相关分析以及数据敏感度分析等方面,说明了TPQP算法在通信消耗、查询响应时间上的优越性。

Uncertain Data PT-Top k Query Processing in Wireless Sensor Network

For the widespread wireless sensor networks applications,due to the quality of sensors and environment factor,the sensor readings are inherently uncertain.With the introduction of the probability dimension in the uncertain data,the query processing technologies for uncertain data become more and more difficult,and the types of uncertain data query have become richer. Uncertain data Top-k query is one of typical query tasks for the uncertain data.Considering the energy consumption and query response time in the wireless sensor network,an uncertain data PT-Top k query processing scheme is studied in a hierarchical structural wireless sensor network.Based on the x-tuple Rule of uncertain data,using intra-cluster and inter-cluster two phases query processing,a distributed Two-Phase PT-Top k Query Proces-sing approximation algorithm (TPQP) was proposed.Finally,the extensive experiment results show that the proposed TPQP can reduce the transmission consumption and query response time in terms of the probability p,the sorted number k,and the data volume.