Location-based caching scheme for mobile clients

  • Authors:
  • KwangJin Park;MoonBae Song;Chong-Sun Hwang

  • Affiliations:
  • Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea

  • Venue:
  • WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.