1st International ICST Conference on Mobile and Ubiquitous Systems

Research Article

Search continuous nearest neighbors on the air

  • @INPROCEEDINGS{10.1109/MOBIQ.2004.1331730,
        author={B.  Zheng and W.-C. Lee and Dik Lun Lee },
        title={Search continuous nearest neighbors on the air},
        proceedings={1st International ICST Conference on Mobile and Ubiquitous Systems},
  • B. Zheng
    W.-C. Lee
    Dik Lun Lee
    Year: 2004
    Search continuous nearest neighbors on the air
    DOI: 10.1109/MOBIQ.2004.1331730
B. Zheng1, W.-C. Lee1, Dik Lun Lee 1
  • 1: Sch. of Inf. Syst., Singapore Manage. Univ., Singapore


A continuous nearest neighbor (CNN) search retrieves the nearest neighbors corresponding to every point in a given query line segment. It is important for location-based services such as vehicular navigation tools and tourist guides. It is infeasible to answer a CNN search by issuing a traditional nearest neighbor query at every point of the line segment due to the large number of queries generated and the large overhead on bandwidth. Algorithms have been proposed recently to support CNN search in the traditional client-server service model. In this paper, we conduct a pioneering study on CNN search in wireless data broadcast environments. We propose two air indexing techniques, namely, R-tree air index and Hilbert curve air index, and develop algorithms based on these two techniques to search CNNs on the air. A simulation is conducted to compare the proposed air indexing techniques with a naive broadcast approach. The result shows that both of the proposed methods outperform the naive approach significantly. The Hilbert Curve air index is superior for uniform data distributions, while the R-tree air index is a better choice for skewed data distributions.