Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based spatial query processing algorithm for LBS. In this algorithm, we simply sort the data objects based on their locations, then the server broadcasts them sequentially to the mobile clients. The experimental results show that the proposed BBS scheme significantly reduces the Access latency. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Park, K., Song, M. B., Kong, K. S., Hwang, C. S., Chung, K. S., & Jung, S. Y. (2005). Range and nearest neighbor query processing for mobile clients. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3762 LNCS, pp. 1097–1106). https://doi.org/10.1007/11575863_132
Mendeley helps you to discover research relevant for your work.