Effective low-latency k-nearest neighbor search via wireless data broadcast

Authors:
KwangJin Park;MoonBae Song;Ki-Sik Kong;Sang-Won Kang;Chong-Sun Hwang;Kwang-Sik Chung;SoonYoung Jung
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;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 National Open University;Dept. of Computer Science Education, Korea University
Venue:
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Year:
2006

Citing 9
Cited 0

Energy efficient indexing on air

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
Search K Nearest Neighbors on Air

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Energy efficient exact kNN search in wireless broadcast environments

Proceedings of the 12th annual ACM international workshop on Geographic information systems
Spatial queries in wireless broadcast systems

Wireless Networks - Special issue: Pervasive computing and communications
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
An efficient data dissemination schemes for location dependent information services

ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

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.