Processing k nearest neighbor queries in location-aware sensor networks

Yingqi Xu, Tao Yang Fu, Wang Chien Lee, Julian Winter

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


Efficient search for k nearest neighbors to a given location point (called a KNN query) is an important problem arising in a variety of sensor network applications. In this paper, we investigate in-network query processing strategies under a KNN query processing framework in location-aware wireless sensor networks. A set of algorithms, namely the geo-routing tree, the KNN boundary tree and the itinerary-based KNN algorithms, are designed in accordance with the global infrastructure-based, local infrastructure-based and infrastructure-free strategies, respectively. They have distinctive performance characteristics and are desirable under different contexts. We evaluate the performance of these algorithms under several sensor network scenarios and application requirements, and identify the conditions under which the various approaches are preferable.

Original languageEnglish (US)
Pages (from-to)2861-2881
Number of pages21
JournalSignal Processing
Issue number12
StatePublished - Dec 2007

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering


Dive into the research topics of 'Processing k nearest neighbor queries in location-aware sensor networks'. Together they form a unique fingerprint.

Cite this