Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments
IEEE Transactions on Mobile Computing
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Casper*: Query processing for location services without compromising privacy
ACM Transactions on Database Systems (TODS)
Energy-efficient shortest path query processing on air
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Shortest path computation with no information leakage
Proceedings of the VLDB Endowment
Spatial queries in wireless broadcast environments
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Energy-efficient air-indices for distance queries on road networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Spatial query processing in road networks for wireless data broadcast
Wireless Networks
Hi-index | 0.00 |
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobile network industry, we propose adopting the wireless broadcast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the first framework to compute shortest paths on the air, and demonstrate the practicality and efficiency of our techniques through experiments with real road networks and actual device specifications.