Clustering algorithms based on minimum and maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
How to net a lot with little: small &egr;-nets for disks and halfspaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Lectures on Discrete Geometry
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Dynamic Data Delivery in Wireless Communication Environments
ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Search K Nearest Neighbors on Air
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Data Broadcast Scheduling: On-line and Off-line Algorithms
Data Broadcast Scheduling: On-line and Off-line Algorithms
Exponential index: a parameterized distributed indexing scheme for data on air
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Adaptive Data Broadcasting in Asymmetric Communication Environments
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
| Hi-index | 0.00 |
Location-dependent data are central to many emerging applications, ranging from traffic information services to sensor networks. The standard pull- and push-based data dissemination models become unworkable since the data volumes and number of clients are high. We address this problem using locale covers, a subset of the original set of locations of interest, chosen to include at least one location in a suitably defined neighborhood of any client. Since location-dependent values are highly correlated with location, a query can be answered using a location close to the query point. Typical closeness measures might be Euclidean distance, or a k-nearest neighbor criterion. We show that location-dependent queries may be answered satisfactorily using locale covers. Our approach is independent of locations and speeds of clients, and is applicable to mobile clients. We also introduce a nested locale cover scheme that ensures fair access latencies, and allows clients to refine the accuracy of their information over time. We also prove two important results: one regarding the greedy algorithm for sensor covers and the other pertaining to randomized locale covers for k-nearest neighbor queries.