A Framework for Generating Network-Based Moving Objects
Geoinformatica
IEEE Transactions on Computers
A Map-Based Dead-Reckoning Protocol for Updating Location Information
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and Data Engineering
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
ACM SIGMOBILE Mobile Computing and Communications Review
Adaptive location constraint processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Buddy tracking - efficient proximity detection among mobile friends
Pervasive and Mobile Computing
Proximity queries in large traffic networks
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Continuous proximity monitoring in road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
Processing proximity relations in road networks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient proximity detection among mobile users via self-tuning policies
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Given a set of moving clients as well as their friend relationships, a road network, and a distance threshold per friend pair, the proximity detection problem in road networks is to find each pair of friends such that the road network distance between them is within the given threshold. The problem of proximity detection is often encountered in friend-locator applications and massively multiplayer online games. Because of the limited battery power and bandwidth, it is better to develop a solution which incurs less communication cost. Hence, the main objective of this problem is to reduce the total communication cost. However, most of the existing proximity detection solutions focus on the Euclidean space but cannot be used in road network space; the solutions for road networks incur substantial communication costs. Motivated by this, we propose two types of solutions to solve the proximity detection problem in road networks. In the first type of solution, each mobile client is assigned with a mobile region of a fixed size. We design algorithms with a fixed radius for the client and server respectively, with the purpose of reducing unnecessary probing messages and update messages. Second, we present a self-tuning policy to adjust the radius of the mobile region automatically to minimize the communication cost. Experiments show that our second type of solution works efficiently and robust with a much lower communication cost with respect to various parameters. In addition, we present our server-side computational cost optimization techniques to reduce the total computational cost.