The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location dependent information services(LDISs) using a VD. To begin our study, we first introduce a broadcast-based spatial query processing methods designed to support NN query processing. In further sections, we introduce a generic method for location-dependent sequential prefetching and caching. The performance of this scheme is studied in different simulated environments. The core contribution of this research, resides in our analytical proof and experimental results. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Park, K. J., Song, M. B., & Hwang, C. S. (2005). Location-based caching scheme for mobile clients. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 233–244). Springer Verlag. https://doi.org/10.1007/11563952_21
Mendeley helps you to discover research relevant for your work.