A broad first K-NN sensor network query algorithm

作者：Xie Yinghong^*; Wu Chengdong; Zhang Yunzhou

来源：International Journal of Digital Content Technology and Its Applications, 2012, 6(11): 172-179.

DOI：10.4156/jdcta.vol6.issue11.22

• Adjacent lists
• Broad First Traserval
• Depth first
• Dynamic network topology
• Filter
• K-NN
• Nearest-neighbors
• Network power
• Process needs
• Query algorithms
• Query costs
• Query information
• Query nodes
• Query results
• Simulation experiments
• Survival time
• Traversal algorithms
• Value-based

The paper proposes a value based broad first K Nearest-Neighbor (K-NN) wireless sensor network query algorithm (BFKQ). Firstly, it sets query range for every node according to samples, when sink receives query request, it determines which k nodes to be queried. By using adjacent list information of the query nodes, the algorithm forms query information as broad first traversal is processed, then sink delivers query information and waits for the query nodes send back query results, Simulation experiment results show that by comparison with the methods of setting filter of FILA algorithm and the naive algorithm, BFKQ algorithm reduces the total hops nodes uploading data at the same samples number. Comparing with GPSR routing algorithm, BFKQ saves the average hops every query process needs, and comparing with depth first traversal algorithm, BFKQ can choose nodes nearer to sink to upload data to be queried, so that network power consumed by query is reduced, which prolongs the survival time of wireless sensor networks consequently. BFKQ algorithm can not only adapt to the dynamic network topology structure, but also can realize the minimal query cost when the value of k changes constantly.

• 出版日期2012
• 单位东北大学