Processing k nearest neighbor queries in location-aware sensor networks
Signal Processing
Introduction to Information Retrieval
Introduction to Information Retrieval
Toward the Optimal Itinerary-Based KNN Query Processing in Mobile Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Parallelizing Itinerary-Based KNN Query Processing in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Cost-Efficient Data Collection Approach Using K-Nearest Neighbors in a 3D Sensor Network
MDM '10 Proceedings of the 2010 Eleventh International Conference on Mobile Data Management
A kNN Query Processing Method in Mobile Ad Hoc Networks
MDM '11 Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management - Volume 01
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
| Hi-index | 0.00 |
In a kNN query processing method, it is important to appropriately estimate the range that includes kNNs. While the range could be estimated based on the node density in the entire network, it is not always appropriate because the density of nodes in the network is not uniform. In this paper, we propose two kNN query processing methods in MANETs where the density of nodes is ununiform; the One-Hop (OH) method and the Query Log (QL) method. In the OH method, the nearest node from the point specified by the query acquires its neighbors' location and then determines the size of a circle region (the estimated kNN circle) which includes kNNs with high probability. In the QL method, a node which relays a reply of a kNN query stores the information on the query result for future queries.