Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
The price of validity in dynamic networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Approximate Data Collection in Sensor Networks using Probabilistic Models
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Controllably Mobile Infrastructure for Low Energy Embedded Networks
IEEE Transactions on Mobile Computing
CarTel: a distributed mobile sensor computing system
Proceedings of the 4th international conference on Embedded networked sensor systems
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Adaptive and decentralized operator placement for in-network query processing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
A Stimulus-Centric Algebraic Approach to Sensors and Observations
GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks
Hi-index | 0.00 |
Efficient data collection in wireless sensor networks (SNs) plays a key role in power conservation. It has spurred a number of research projects focusing on effective algorithms that reduce power consumption with effective in-network aggregation techniques. Up to now, most approaches are based on the assumption that data collection involves all nodes of a network. There is a large number of queries that in fact select only a subset of the nodes in a SN. Thus, we concentrate on selective queries, i.e., queries that request data from a subset of a SN. The task of optimal data collection in such queries is an instance of the NP-hard minimal Steiner tree problem. We argue that selective queries are an important class of queries that can benefit from algorithms that are tailored for partial node participation of a SN. We present an algorithm, called Pocket Driven Trajectories (PDT), that optimizes the data collection paths by approximating the global minimal Steiner tree using solely local spatial knowledge. We identify a number of spatial factors that play an important role for efficient data collection, such as the distribution of participating nodes over the network, the location and dispersion of the data clusters, the location of the sink issuing a query, as well as the location and size of communication holes. In a series of experiments, we compare performance of well-known algorithms for aggregate query processing against the PDT algorithm in partial node participation scenarios. To measure the efficiency of all algorithms, we also compute a near-optimal solution, the globally approximated minimal Steiner tree. We outline future research directions for selective queries with varying node participation levels, in particular scenarios in which node participation is the result of changing physical phenomena as well as reconfigurations of the SN itself.