This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
July 2007 (vol. 6 no. 7)
pp. 748-761
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{\hbox{-}}\rm nearest 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.
Index Terms:
Continuous nearest neighbor search, broadcast, indexing, location-based services.
Citation:
Baihua Zheng, Wang-Chien Lee, Dik Lun Lee, "On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems," IEEE Transactions on Mobile Computing, vol. 6, no. 7, pp. 748-761, July 2007, doi:10.1109/TMC.2007.1004
Usage of this product signifies your acceptance of the Terms of Use.