Optimal nearest neighbor queries in sensor networks

Gokarna Sharma, Costas Busch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Given a set of m mobile objects in a sensor network, we consider the problem of finding the nearest object among them from any node in the network at any time. These mobile objects are tracked by nearby sensors called proxy nodes. This problem requires an object tracking mechanism which typically relies on two basic operations: query and update. A query is invoked by a node each time when there is a need to find the closest object from it in the network. Updates of an object's location are initiated when the object moves from one location (proxy node) to another. We present a scalable distributed algorithm for tracking these mobile objects such that both the query cost and the update cost is minimized. The main idea is that given a set of mobile objects our algorithm maintains a virtual tree of downward paths pointing to the objects. Our algorithm guarantees an O (1) approximation for query cost and an O (min { log n, log D }) approximation for update cost in the constant-doubling graph model, where n and D, respectively, are the number of nodes and the diameter of the network. We also give polylogarithmic approximations for both query and update cost in the general graph model. Our bounds are deterministic and hold in the worst-case. Moreover, our algorithm requires only polylogarithmic bits of memory per node. To our best knowledge, this is the first algorithm that is asymptotically optimal in handling nearest neighbor queries with low update cost.

Original languageEnglish (US)
Title of host publicationAlgorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Revised Selected Papers
PublisherSpringer Verlag
Pages260-277
Number of pages18
ISBN (Print)9783642453458
DOIs
StatePublished - 2013
Externally publishedYes
Event9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013 - Sophia Antipolis, France
Duration: Sep 5 2013Sep 6 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8243 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013
CountryFrance
CitySophia Antipolis
Period9/5/139/6/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal nearest neighbor queries in sensor networks'. Together they form a unique fingerprint.

Cite this