基于过滤器的K-NN深度优先查询算法-东北大学学报.PDFVIP

第32 卷第8期 东 北 大 学 学 报 ( 自 然 科 学 版 ) Vol132, No. 8 2 0 1 1 年 8 月 Journal of Northeastern U niversit ( Natural Science) Aug. 2 0 1 1 K - NN 1 1 1 2 谢英红, 吴成东, 张云洲 , 李孟歆 ( 1. , 110819; 2. , 110168) : , , K - NN ( FKDF) K - NN ; # , ; , , : FILA GPSR , FKDF # , , K # : ; ; K - NN ; ; : TP 393 : A : 1005-3026( 2011) 08-1076-04 A Depth-First K- NN Query Algorithm Based on Filters 1 1 1 2 XIE Ying-hong , W U Cheng-dong , ZHA N G Yun-z hou , L I M eng-x in ( 1. School of Information Science Engineering , Northeastern Universit , Shen ang 110819, China; 2. School of Information Control Engineering, Shen ang Jianzhu Universit , Shen ang 110168, China. Corresponding author : XIE Y ing-hong, E-mail: xie inghong @ 163. com) Abstract: To reduce the energ consumption for data quer and prolong the lifetime of w ireless sensor netw orks, a depth-first K-NN quer algorithm based on filters is proposed( FKDF) . In the FKDF algorithm , the K-NN quer range is determined b setting filters for each node. As depth first traversal is carried out, the quer information is formed b using adjacent list information of the quer nodes. Then, a sink node delivers quer information and w aits for the quer nodes sending back quer results, thereb decreasing the average hops per quer process needed consequentl . Simulation results show that FKDF algorithm reduces the average hops per quer process needed, compared w ith the FILA algorithm setting filters and the GPSR routing algorithm, and it can not onl