K Nearest Neighbors Queries in Multi-channel Broadcast Environments

Abstract

Data broadcasting is an effective way to disseminate information to a large amount of mobile clients in wireless mobile environments. K nearest neighbors (kNN) search is one of the important location-based services and allows clients to get the points of interests around them in a given data set. In this paper, we propose a kNN search protocol using multiple data broadcast channel. We provide several data broadcast schedules for multiple channels and compare them with the ones for single channel using the latency and tuning time as the measurements. The latency is the time elapsed between issuing and termination of the query and the tuning time is the amount of time spent on listening to the channel. In our design, we use Voronoi diagram and no index structure is referred in the broadcast. The proposed protocol will use some additional information for each broadcast data instead to achieve the objectives. The effectiveness and performance of the proposed protocol will be verified by proofs and simulation experiments.