Broadcast Schedules and Query Processing for k Nearest Neighbors Search on Multi-dimensiona.pdf

2006 IEEE Conference on Systems, Man, and Cybernetics October 8-11, 2006, Taipei, Taiwan 1-4244-0100-3/06/$20.00 ?2006 IEEE Broadcast Schedules and Query Processing for k Nearest Neighbors Search on Multi-dimensional Index Trees in a Multi-Channel Environment Shu-Yu Fu and Chuan-Ming Liu Abstract—Broadcasting data with an index is an effective way to disseminate public information to a large clients. For a server, using multiple channels to provide services (e.g., location-based services) makes the broadcast cycle shorter than using one channel. Among location-based services, the k nearest neighbors (kNN) search is an important one and finds the k closest objects to a query point in a multi-dimensional space. This paper considers k nearest neighbors search on a broadcast R-tree in a multi-channel environment. We assume that a mobile client can only tune into a specified channel at one time instance. We study how a server generates the broadcast schedules on multiple channels and explore how a client executes the kNN search on the broadcast. Different broadcast schedules with the client kNN search processing makes different kNN search protocols. The objectives of the protocols is to minimize the latency (i.e., the time elapsed between issuing and termination of the query), tuning time (i.e., the amount of time spent on listening to the channel), and the memory usage for kNN search processing. Last, we present our experiments and the experiment results validate that our mechanisms achieve the objectives. I. INTRODUCTION In a wireless mobile environment, the bandwidth is asym- metric [1]. In other words, the bandwidth of down-link (server-to-client) is much greater than the bandwidth of up- link (client-to-server). The conventional client-server model hence is a poor match with the wireless mobile environment when the group of mobile clients is large due to the bot- tleneck of the uplink. Data broadcasting therefore provides an effective approach to dis