On searching continuous k nearest neighbors in wireless data broadcast systems

Baihua Zheng, Wang Chien Lee, Dik Lun Lee

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


A continuous nearest neighbor(CNN) search, which retrieves the nearest neighbors corresponding to every point in a given query line segment, is important for location-based services such as vehicular navigation 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 overhead on bandwidth. Algorithms have been proposed recently to support CNN search in the traditional client-server systems but not in the environment of wireless data broadcast, where uplink communication channels from mobile devices to the server are not available. In this paper, we develop a generalized search algorithm for continuous k-uearest neighbors based on Hilbert Curve Index in wireless data broadcast systems. A performance evaluation is conducted to compare the proposed search algorithms with an algorithm based on R-tree Air Index. The result shows that the Hilbert Curve Index-based algorithm is more energy efficient than the R-tree-based algorithm.

Original languageEnglish (US)
Pages (from-to)748-761
Number of pages14
JournalIEEE Transactions on Mobile Computing
Issue number7
StatePublished - Jul 2007

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'On searching continuous k nearest neighbors in wireless data broadcast systems'. Together they form a unique fingerprint.

Cite this