Robust K nearest neighbor query processing algorithm in wireless sensor networks

A robust K nearest neighbor query processing algorithm called ROC-KNN was proposed.It divides the query region into several sub-regions according the network topology.Each sub-region has a cluster node which collects the sensory data in it,sends it to the cluster node in the next sub-region until tr...

Full description

Saved in:
Bibliographic Details
Main Authors: LIU Liang, QIN Xiao-lin, LIU Ya-li, LI Bo-han
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2010-01-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/74644533/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A robust K nearest neighbor query processing algorithm called ROC-KNN was proposed.It divides the query region into several sub-regions according the network topology.Each sub-region has a cluster node which collects the sensory data in it,sends it to the cluster node in the next sub-region until traversing all the sub-regions.Two distributed heuristic sub-region size setting and cluster node election algorithms were proposed to reduce the energy consumption.A query processing recovery algorithm using the non-cluster nodes in each sub-region was designed to reduce the outage probability caused by cluster node failures.The experimental results show that the ROC-KNN outperforms the existing algorithms in terms of energy consumption and query success rate.
ISSN:1000-436X