Practical selectivity estimation through adaptive sampling
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Wireless integrated network sensors
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Discrete event simulations with J-Sim
PPPJ '02/IRE '02 Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002
Spatio-Temporal Aggregation Using Sketches
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
End-biased Samples for Join Cardinality Estimation
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Network-Aware Operator Placement for Stream-Processing Systems
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Adaptive Control of Extreme-scale Stream Processing Systems
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Foundations and Trends in Databases
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Scalable service migration in general topologies
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
PrDB: Managing Large-Scale Correlated Probabilistic Databases (Abstract)
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Minimum-hot-spot query trees for wireless sensor networks
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Probability based dynamic load-balancing tree algorithm for wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Editorial: Intelligent algorithms for data-centric sensor networks
Journal of Network and Computer Applications
Journal of Network and Computer Applications
| Hi-index | 0.00 |
In this paper, we focus the attention on the operator placement problem in Wireless Sensor Networks (WSN). This problem is very relevant for in-network query processing over WSN, where query routing trees are decomposed into three sub-components that must be processed at query time, namely operator tree, operator placement assignment scheme and routing scheme. In particular, the operator placement assignment defines on which node of the network each (query) operator will be hosted and executed. Hence, operator placement plays a key role in the context of query optimization issues in WSN research. In line with this main motivation, in this paper we present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameter-free algorithm finds the optimal node to host the operator with minimum communication cost overhead. Three techniques, proposed here, make this feature possible: (1) identifying the special, and most frequent case, where no flooding is needed, otherwise (2) limitation of the neighborhood to be flooded and (3) variable speed flooding and eves-dropping. When no flooding is needed the communication cost overhead for adapting the operator placement is negligible. In addition, our algorithm does not require any extra communication cost while the query is executed. In our experiments we show that for the rest of cases our algorithm saves 30%-85% of the energy compared to previously proposed techniques. To our knowledge this is the first optimal and distributed algorithm to solve the 1-median (Fermat node) problem. A comprehensive experimental evaluation and the proposal of two solutions that are capable of dealing with adaptive properties of the operator placement problem, which is an innovative perspective of research in this scientific field, represent two further contributions of our research.