Abstract
To facilitate power saving via wireless data broadcast, index information is typically broadcast along with the data. By first accessing the broadcast index, the mobile client is able to predict the arrival time of the desired data. However, it suffers from the drawback that the client has to wait and tune for an index segment, in order to conserve battery power consumption. Moreover, the average time elapsed between the request for the data and its receipt may increase as a result of these additional messages. In this paper, we present a broadcast-based spatial query processing method designed to support K-NN(K-Nearest Neighbor) queries via wireless data broadcast. With the proposed schemes, the client can perform NN query processing without having to tune into an index segment. Experiments are conducted to evaluate the performance of the proposed methods. The resulting latency and energy consumption are close to the optimum values, as the analysis and simulation results indicate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zheng, B., Lee, W.-C., Lee, D.: Search K Nearest Neighbors on Air. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 181–195. Springer, Heidelberg (2003)
Imielinski, T., Viswanathan, S., Badrinath, B.R.: Energy efficient indexing on air. In: Proc. of SIGMOD, pp. 25–36 (1994)
Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on Air: Organization and Access. IEEE Trans. Knowledge and Data Eng 9(3), 353–372 (1997)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of SIGMOD, pp. 47–57 (1984)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. of SIGMOD, pp. 71–79 (1995)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: Proc. of ICDE, pp. 643–654 (2005)
Zheng, B., Lee, W.-c., Lee, D.L.: Spatial Queries in Wireless Broadcast Systems. Wireless Network 10(6), 723–736 (2004)
Gedik, B., Singh, A., Liu, L.: Energy Efficient Exact kNN Search in Wireless Broadcast Environments. In: Proc. of GIS, pp. 137–146 (2004)
Park, K., Song, M., Hwang, C.: An Efficient Data Dissemination Schemes for Location Dependent Information Services. In: Ghosh, R.K., Mohanty, H. (eds.) ICDCIT 2004. LNCS, vol. 3347, pp. 96–105. Springer, Heidelberg (2004)
Shallit, J.O.: On infinite products associated with sums of digits. Journal of Number Theory 21, 128–134 (1985)
Kasten, O.: Energy consumption. ETH-Zurich, Swiss Federal Institute of Technology, Available at: http://www.inf.ethz.ch/~kasten/research/bathtub/energy_consumption.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, K. et al. (2006). Effective Low-Latency K-Nearest Neighbor Search Via Wireless Data Broadcast. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_67
Download citation
DOI: https://doi.org/10.1007/11733836_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33337-1
Online ISBN: 978-3-540-33338-8
eBook Packages: Computer ScienceComputer Science (R0)