Reverse Nearest Neighbors Search in Wireless Broadcast Environments

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 reverse nearest neighbor (RNN) search is one of the most important location-based services. Given a query point $q$ and a data set $P$, the RNN search is to find all the points to which $q$ is the closest respectively among all the other data points in $P$. In this paper, we propose an RNN search protocol using data broadcasting. We consider how the server generates the broadcast schedules and provide an effective RNN query process on the client side in terms of query processing time and power consumption. In our design, we use Voronoi diagram and no index structure is needed in the broadcast. The proposed protocol will uses some additional information for each broadcast data to achieve the objectives. The effectiveness and performance of the proposed protocol will be verified by proofs and simulation experiments.