The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Understanding Link Quality in 802.11 Mobile Ad Hoc Networks
IEEE Internet Computing
Peer-to-Peer Cooperative Caching in Mobile Environments
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Group-Based Cooperative Cache Management for Mobile Clients in a Mobile Environment
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
MAPLE: A Mobile Scalable P2P Nearest Neighbor Query System for Location-based Services
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Location-based Spatial Queries with Data Sharing in Mobile Environments
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Cooperative caching: using remote client memory to improve file system performance
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
IEEE Journal on Selected Areas in Communications
GroCoca: group-based peer-to-peer cooperative caching in mobile environment
IEEE Journal on Selected Areas in Communications
SPID: a novel P2P-based information diffusion scheme for mobile networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A pure P2P paradigm for query processing in mobile ad-hoc networks
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks
Information Sciences: an International Journal
A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks
Personal and Ubiquitous Computing
A scheduling method to reduce waiting time for close-range broadcasting
Mobile Information Systems
| Hi-index | 0.00 |
Nearest neighbor queries, such as determining the proximity of stationary objects (e.g., restaurants and gas stations) are an important class of inquiries for supporting location-based services. We present a novel approach to support nearest neighbor queries from mobile hosts by leveraging the sharing capabilities of wireless ad-hoc networks. We illustrate how previous query results cached in the local storage of neighboring mobile users can be leveraged to either fully or partially compute and verify nearest neighbor queries at a local host. The feasibility and appeal of our technique is illustrated through extensive simulation results that indicate a considerable reduction of the query load on the remote database. Furthermore, the scalability of our approach is excellent because a higher density of mobile hosts increases its effectiveness.