摘要
为了减少不规则区域时空查询处理的能量消耗和提高查询结果准确性,该文提出了一种基于树的不规则区域时空数据收集查询算法,该算法将查询区域内的节点组织成一颗树,树中的节点依次将其感知数据发送至其父节点直至汇聚到树的根节点。针对不规则区域时空聚集查询,提出了一种基于路线的算法,该算法沿一条路线收集查询区域内节点的感知数据并对其进行聚集以生成最终的查询结果。这两种算法均通过将复杂的不规则查询区域划分为简单的凸多边形,降低了判断节点是否在查询区域内的计算复杂度,且保证仅查询区域内的节点发送感知数据,减少了能量消耗。仿真实验结果表明,该文提出的算法优于现有的针对规则区域的时空查询处理算法。
In order to reduce the energy consumption of irregular spatio-temporal query processing and improve the query success rate,a tree-based algorithm is proposed to process spatio-temporal data collection queries with irregular query regions.It organizes sensor nodes in query regions as a tree.The nodes in the tree send local data to their parents until reaching the root of the tree.An itinerary-based algorithm to process spatio-temporal data aggregation queries with irregular query regions is also proposed here.It collects the data of nodes in the query region and aggregates them along an itinerary to generate the final query result.Both of them divide the complex and irregular query region into some simple convex polygons in order to reduce the computational complexity of determining whether the nodes are in the query region and ensure that only the nodes in query regions send the sensed data,thus reducing the energy consumption.The experimental results show that the proposed algorithms outperform the existion spatio-temporal query processing algorithms for irregular region query.
出处
《南京理工大学学报》
EI
CAS
CSCD
北大核心
2011年第1期31-37,共7页
Journal of Nanjing University of Science and Technology
基金
国家自然科学基金(60673127)
国家"863"计划资助项目(2007AA01Z404)
江苏省科技支撑计划(BE2008135)
关键词
无线传感器网络
查询处理
时空查询
不规则查询区域
wireless sensor networks
query processing
spatio-temporal queries
irregular query regions