期刊文献+

基于网格的传感器网络K近邻查询处理算法

Grid-based K Nearest Neighbor Query Processing Algorithm in Wireless Sensor Networks
在线阅读 下载PDF
导出
摘要 综合考虑了能量消耗、查询延迟、查询结果正确性等因素,提出了一种基于网格的传感器网络K近邻查询处理算法GKNN。它优化现有的查询区域估计方法以减少算法的能量消耗。利用网格对节点进行管理,将查询区域中的网格划分成多个网格区,由各个网格区并行处理查询从而减少延迟。另外,GKNN利用节点冗余降低了节点失效对查询结果的影响,提高了查询结果的正确性。仿真实验结果表明,GKNN优于现有的算法。 A grid-based KNN query processing algorithm called GKNN was proposed in this paper which takes energy consumption,query latency,query result correctness and etc into consideration in an integrated way.It optimizes the existing query area estimation methods in order to reduce the energy consumption of the algorithm.GKNN takes advantage of grids to manage the nodes and divides the query region into several grid zones.Each grid zone processes query parallel to reduce query latency.Furthermore,GKNN takes advantage of node redundancy to reduce the influence of node failures on query result correctness which improves the accuracy of query result.Experimental results show that GKNN outperforms the existing algorithms.
出处 《计算机科学》 CSCD 北大核心 2011年第5期31-36,共6页 Computer Science
基金 国家自然科学基金资助项目(60673127) 国家高技术研究发展计划("863"计划)基金资助项目(2007AA01Z404) 江苏省科技支撑计划(BE2008135) 工信部电子信息产业发展基金项目资助
关键词 无线传感器网络 查询处理 K近邻查询 节点失效 Wireless sensor network Query processing KNN query Node failures
  • 相关文献

参考文献13

  • 1Guttman A. R-Trees: A Dynamic Index Structure for Spatial Searching [C]//Proceeding of the 1984 ACM SIGMOD interna- tional conference on Management of data. New York: ACM Press, 1984: 47-57.
  • 2Roussopoulos A, Kelley S, Vincent F. Nearest Neighbor Queries [C]//Proceeding of the 1984 ACM SIGMOD international conference on Management of data. New York: ACM Press, 1995: 71-79.
  • 3Demirbas M, Ferhatosmanoglu H. Peer-to-Peer Spatial Queries in Sensor Networks [C]//Proceeding of the IEEE International Conference on Peer-to-Peer Computing Peer-to-Peer Computing. Washington: IEEE Computer Society, 2003 : 32-39.
  • 4Goldin D, Song M, Kutlu A, et al. Georouting and delta-gathering:Efficient data propagation techniques for geosensor networks [C] // Proceeding of GeoSensor Networks Workshop. Portland, Maine, 2003.
  • 5Winter J, Lee W K. A dynamic knn query processing algorithm for location-aware sensor networks[C]//Proceedging of the 1st International Workshop on Data Management for Sensor Networks in Conjunction with VLDB 2004. New York: ACM Press, 2004:119-124.
  • 6Karp B, Kung H T. GPSR: greedy perimeter stateless routing for wireless networks [C]//Proceeding of the 6th annual inter- national conference on mobile computing and networking. New York,, ACM Press, 2000 : 243-254.
  • 7Xu Y, Fu T Y, Lee W C, et al. Itinerary-based Techniques for Processing K Nearest Neighbor Queries in Location-aware Sensor Networks [J]. Signal Processing, 2007,87 (12) : 2861-2881.
  • 8Xu Yingqi, Lee Wang-chien, Xu Jianliang, et al. Processing Window Queries in Wireless Sensor Networks [C]///Proceeding of the 22rd International Conference on Data Engineering. Washington: IEEE Computer Society, 2006 : 70-70.
  • 9Yao Yuxia, Tang Xueyan, Lim Ee-peng. Localized monitoring of kNN queries in wireless sensor networks [J]. Journal of Very Large Database,2009,18(1) :99-117.
  • 10Wu Shan-hung,Chuang Kun-ta,Chen Chung-mi, et al. DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks[C]//Proceeding of the 23rd International Conference on Data Engineering. Washington: IEEE Computer Society, 2007 : 456-465.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部