By Topic

Group kNN queries based on P2P for moving objects

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiao-Yu Song ; Sch. of Inf. & Control Eng., Shenyang Jianzhu Univ., Shenyang, China ; Jing-Ke Xu ; Huan-Liang Sun ; Chun-Guang Chang

We propose the framework for monitoring k-nearest neighbor (kNN) query based on peer-to-peer (P2P) structure. In the framework, moving objects with mobile equipment can finish some computation to help finding global kNN. A group-query algorithm is introduced which adopt two new techniques named distance-time and section-sort to speed-up the query. The cost of CPU time and wireless communication could be reduced largely. In the simulation experiments, the algorithms improve the efficiency largely.

Published in:

Machine Learning and Cybernetics, 2009 International Conference on  (Volume:3 )

Date of Conference:

12-15 July 2009