DocumentCode :
3422211
Title :
An operator placement algorithm for complex in-network processing
Author :
Lachenmann, Andreas ; Sadasiva, Venkatesh Bommasandra ; Siegemund, Frank
Author_Institution :
Eur. Microsoft Innovation Center GmbH, Germany
fYear :
2009
fDate :
17-19 June 2009
Firstpage :
1
Lastpage :
4
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.
Keywords :
graph theory; telecommunication network topology; wireless sensor networks; aggregation function; complex in-network processing; data flow graphs; network topology; network-level programming model; operator placement; wireless sensor network; Concrete; Data communication; Flow graphs; Network topology; Polynomials; Scheduling algorithm; Senior citizens; Sensor systems; Technological innovation; Tree graphs; data flow; operator placement; wireless sensor network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networked Sensing Systems (INSS), 2009 Sixth International Conference on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
978-1-4244-6313-8
Electronic_ISBN :
978-1-4244-6314-5
Type :
conf
DOI :
10.1109/INSS.2009.5409949
Filename :
5409949
Link To Document :
بازگشت