Group kNN queries based on P2P for moving objects

Author

Song, Xiao-yu ; Xu, Jing-ke ; Sun, Huan-liang ; Chang, Chun-guang

Author_Institution

Sch. of Inf. & Control Eng., Shenyang Jianzhu Univ., Shenyang, China

Volume

3

fYear

2009

fDate

12-15 July 2009

Firstpage

1581

Lastpage

1585

Abstract

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.

Keywords

peer-to-peer computing; query processing; distance-time algorithm; group-query algorithm; k-nearest neighbor query monitoring; mobile equipment; peer-to-peer structure; section-sort algorithm; simulation experiment; wireless communication; Base stations; Condition monitoring; Control engineering; Costs; Cybernetics; Machine learning; Mobile communication; Mobile computing; Peer to peer computing; Sun; Critical algorithm; Interzone-time algorithm; KNN; Peer-to-peer;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2009 International Conference on

Conference_Location

Baoding

Print_ISBN

978-1-4244-3702-3

Electronic_ISBN

978-1-4244-3703-0

Type

conf

DOI

10.1109/ICMLC.2009.5212289

Filename

5212289