Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Managing uncertainty in sensor database
ACM SIGMOD Record
Distributed deviation detection in sensor networks
ACM SIGMOD Record
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Energy-efficient surveillance system using wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Compressing historical information in sensor networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Prediction and indexing of moving objects with unknown motion patterns
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Balancing energy efficiency and quality of aggregate data in sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
Snapshot Queries: Towards Data-Centric Sensor Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
REED: robust, efficient filtering and event detection in sensor networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient Single-Anchor Localization in Sensor Networks
DSSNS '06 Proceedings of the Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems
An Efficient Resilience Mechanism for Data Centric Storage in Mobile Ad Hoc Networks
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Detecting the Direction of Motion in a Binary Sensor Network
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
Contour map matching for event detection in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Adaptive cleaning for RFID data streams
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Stochastic coverage in heterogeneous sensor networks
ACM Transactions on Sensor Networks (TOSN)
Journal of Parallel and Distributed Computing
Practical data-centric storage
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Processing proximity queries in sensor networks
DMSN '06 Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006
Distributed set-expression cardinality estimation
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Suppression and failures in sensor networks: a Bayesian approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Peer-to-peer similarity search in metric spaces
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Design and optimization of distributed sensing coverage in wireless sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Workload-Aware Query Routing Trees in Wireless Sensor Networks
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
MINT Views: Materialized In-Network Top-k Views in Sensor Networks
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
The MicroPulse Framework for Adaptive Waking Windows in Sensor Networks
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
TACO: tunable approximate computation of outliers in wireless sensor networks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Level biased random walk for information discovery in wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Similarity-aware query processing in sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.00 |
Sensor networks are often used to perform monitoring tasks, such as animal and vehicle tracking, or the surveillance of enemy forces in military applications. In this paper we introduce the concept of proximity queries, which allow us to report interesting events, observed by nodes in the network that lie within a certain distance from each other. An event is triggered when a user-programmable predicate is satisfied on a sensor node. We study the problem of computing proximity queries in sensor networks and propose several alternative techniques that differ in the number of messages exchanged by the nodes and the quality of the returned answers. Our solutions utilize a distributed routing index, maintained by the nodes in the network, that is dynamically updated as new observations are obtained by the nodes. This distributed index allows us to efficiently process multiple proximity queries involving several different event types within a fraction of the cost that a straightforward evaluation requires. We present an extensive experimental study to show the benefits of our techniques under different scenarios using both synthetic and real data sets. Our results demonstrate that our algorithms scale better and require significantly fewer messages compared to a straightforward execution of the queries.