An operator placement algorithm for complex in-network processing

Authors:
Andreas Lachenmann;Venkatesh Bommasandra Sadasiva;Frank Siegemund
Affiliations:
European Microsoft Innovation Center GmbH, Germany;European Microsoft Innovation Center GmbH, Germany;European Microsoft Innovation Center GmbH, Germany
Venue:
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Year:
2009

Citing 7
Cited 0

A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System

IEEE Transactions on Software Engineering
Meeting lifetime goals with energy levels

Proceedings of the 5th international conference on Embedded networked sensor systems
Programming models for sensor networks: A survey

ACM Transactions on Sensor Networks (TOSN)
Censor networks: a critique of "sensor networks" from a systems perspective

ACM SIGCOMM Computer Communication Review
Adaptive and decentralized operator placement for in-network query processing

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In sensor network applications that do complex in-network processing, each node may perform its own task rather than all nodes executing the same aggregation function. To support the development of such applications, this paper introduces a network-level programming model that is based on the data flow in the application. When deploying the application, such a high-level model has to be mapped to nodes in the specific network topology. This paper presents an operator placement algorithm that tries to find an optimal mapping that minimizes data transmission throughout the network.