Tuning query performance in mobile sensor databases
Proceedings of the 6th international conference on Mobile data management
Alternating multiple tributaries + deltas
Proceedings of the 5th workshop on Data management for sensor networks
SNQL: a query language for sensor network databases
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Sensor Queries: Algebraic Optimization for Time and Energy
International Journal of Distributed Sensor Networks
Coverage algorithms in GPS-less wireless mobile sensor networks
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Optimized query routing trees for wireless sensor networks
Information Systems
| Hi-index | 0.00 |
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. In this work, we propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a Data Transmission Algebra (DTA) and apply it for efficient generation of such query trees.