Peer-to-peer spatial queries in sensor networks

Sensor networks, that consist of potentially several thousands of nodes each with sensing (heat, sound, light, magnetism, etc.) and wireless communication capabilities, provide great opportunities for monitoring spatial information about a region of interest. Although spatial query execution has been studied extensively in the context of database systems (e.g., indexing technologies), these solutions are not directly applicable in the context of sensor networks due to the decentralized nature of the sensor networks and the limited computational power and energy scarcity of individual sensor nodes. We present a peer-to-peer indexing structure, namely peer-tree, in order to address the problem of energy- and time-efficient execution of spatial queries (such as nearest-neighbor queries) in sensor networks. Loosely speaking, our peer-tree structure can be interpreted as a peer-to-peer version of the centralized R-tree index structure. Using the peer-tree as a building block, we present a peer-to-peer query processing model where a query can be posed in any node of the network without the need of a central server. For achieving minimal energy consumption and minimal response time, our query processing model ensures that only the relevant nodes for the correct execution of a query are involved in the query execution.

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[2]  Christos Faloutsos,et al.  Efficient and effective Querying by Image Content , 1994, Journal of Intelligent Information Systems.

[3]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[4]  Anish Arora,et al.  The mote connectivity protocol , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[5]  Hanan Samet,et al.  Ranking in Spatial Databases , 1995, SSD.

[6]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[7]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[8]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[9]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[10]  Christian Böhm,et al.  A cost model for nearest neighbor search in high-dimensional data space , 1997, PODS.

[11]  S. Muthukrishnan,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.

[12]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[13]  Christos Faloutsos,et al.  Fast Nearest Neighbor Search in Medical Image Databases , 1996, VLDB.

[14]  Murat Demirbas,et al.  A Pursuer-Evader Game for Sensor Networks , 2003, Self-Stabilizing Systems.

[15]  Ajoy Kumar Datta,et al.  Self-stabilizing PIF algorithm in arbitrary rooted networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[16]  Hongwei Zhang,et al.  GS3: scalable self-configuration and self-healing in wireless networks , 2002, PODC '02.

[17]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[19]  Ambuj K. Singh,et al.  Scalable access within the context of digital libraries , 1998, International Journal on Digital Libraries.

[20]  Deborah Estrin,et al.  Adaptive beacon placement , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[21]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[22]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[23]  Jun Xu,et al.  Towards dependable home networking: an experience report , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[24]  Hans-Peter Kriegel,et al.  S3: similarity search in CAD database systems , 1997, SIGMOD '97.

[25]  Divyakant Agrawal,et al.  Approximate Range Selection Queries in Peer-to-Peer Systems , 2003, CIDR.

[26]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[27]  King-Ip Lin,et al.  An index structure for efficient reverse nearest neighbor queries , 2001, Proceedings 17th International Conference on Data Engineering.

[28]  Murat Demirbas,et al.  LOCI: Local Clustering Service for Large Scale Wireless Sensor Networks , 2003 .

[29]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[30]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

[31]  Divyakant Agrawal,et al.  Constrained Nearest Neighbor Queries , 2001, Encyclopedia of GIS.