|
Abstract:
|
Data broadcasting is an effective way to disseminate information to a large amount of mobile clients in wireless mobile environments. Many information services can use such a technique to serve the clients, including location-based services. The k nearest neighbor (kNN) search is one of the important location-based services. With such a search, the clients can get the points of interests around them. In this paper, we propose kNN search protocols using data broadcasting. We consider how the server generates the broadcast schedule with a Voronoi diagram and how the client can efficiently execute the query process in terms of latency (time interval from issuing and terminating a query) and tuning time (time spent on listening to the broadcast). Many previous papers used an index on the data points in the broadcast to reduce the latency and tuning time. Our proposed kNN search protocols will not use an index. Instead, the proposed protocols use some additional information for each broadcast data and consider the locality of data points. The effectiveness of the proposed protocols will be verified by proofs and a simulation.
|
