Towards planet-scale localization on smartphones with a partial radiomap
Proceedings of the 4th ACM international workshop on Hot topics in planet-scale measurement
| Hi-index | 0.00 |
Consider a centralized query operator that identifies to every smart phone user its k geographically nearest neighbors at all times, a query we coin Continuous All k-Nearest Neighbor (CAkNN). Such an operator could be utilized to enhance public emergency services, allowing users to send SOS beacons out to the closest rescuers and allowing gamers or social networking users to establish ad-hoc overlay communication infrastructures, in order to carry out complex interactions. In this paper, we study the problem of efficiently processing a CAkNN query in a cellular or WiFi network, both of which are ubiquitous. We introduce an algorithm, coined Proximity, which answers CAkNN queries in O(n(k+lambda)) time, where n denotes the number of users and lambda a network-specific parameter (lambda