Sciweavers

45 search results - page 1 / 9
» Optimizing parallel itineraries for knn query processing in ...
Sort
View
CIKM
2007
Springer
13 years 11 months ago
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
Tao-Young Fu, Wen-Chih Peng, Wang-Chien Lee
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 6 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
DCOSS
2009
Springer
13 years 11 months ago
Similarity Based Optimization for Multiple Query Processing in Wireless Sensor Networks
Wireless sensor networks (WSNs) have been proposed for a large variety of applications. As the number of applications of sensor networks continue to grow, the number of users in se...
Hui Ling, Taieb Znati
ICDCS
2007
IEEE
13 years 11 months ago
Two-Tier Multiple Query Optimization for Sensor Networks
When there are multiple queries posed to the resourceconstrained wireless sensor network, it is critical to process them efficiently. In this paper, we propose a Two-Tier Multipl...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
IS
2011
12 years 11 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...