Time-decaying sketches for sensor data aggregation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Context-aware adaptive data stream mining
Intelligent Data Analysis - Knowledge Discovery from Data Streams
Time-decaying Sketches for Robust Aggregation of Sensor Data
SIAM Journal on Computing
Cost analysis for complex in-network event processing in heterogeneous wireless sensor networks
Proceedings of the 5th ACM international conference on Distributed event-based system
Situation-Aware adaptive visualization for sensory data stream mining
Sensor-KDD'08 Proceedings of the Second international conference on Knowledge Discovery from Sensor Data
SEPSen: semantic event processing at the sensor nodes for energy efficient wireless sensor networks
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.00 |
In wireless sensor networks, energy is the most crucial resource. In-network data processing is a common technique in which an intermediate proxy node is chosen to house a possibly complicated data transformation function to consolidate the sensor data streams from the source nodes, en route to the sink node. We investigate into the placement problem of the proxy. We formulate and solve the energy minimization problem analytically, based on an ENergy- Efficient Rate-Governed Yardstick (ENERGY). An optimal solution is derived based on complete network topology information. Taking into account realistic sensor network constraints that only neighboring network connectivity is known to a node, we develop an approximate but effective solution, ENERGY . We evaluate the performance of ENERGY, which performs well even in low-density networks and for queries requesting from data sources at a distance.