Adaptive and Decentralized Operator Placement for In-Network Query Processing

In-network query processing is critical for reducing network traffic when accessing and manipulating sensor data. It requires placing a tree of query operators such as filters and aggregations but also correlations onto sensor nodes in order to minimize the amount of data transmitted in the network....

Full description

Saved in:
Bibliographic Details
Published in:Telecommunication systems Vol. 26; no. 2-4; pp. 389 - 409
Main Authors: Bonfils, Boris Jan, Bonnet, Philippe
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.06.2004
Subjects:
Algorithms
Assignment problem
Collaboration
Data processing
Queries
Sensors
Signal processing
Telecommunications systems
Wireless networks
ISSN:1018-4864, 1572-9451
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In-network query processing is critical for reducing network traffic when accessing and manipulating sensor data. It requires placing a tree of query operators such as filters and aggregations but also correlations onto sensor nodes in order to minimize the amount of data transmitted in the network. In this paper, we show that this problem is a variant of the task assignment problem for which polynomial algorithms have been developed. These algorithms are however centralized and cannot be used in a sensor network. We describe an adaptive and decentralized algorithm that progressively refines the placement of operators by walking through neighbor nodes. Simulation results illustrate the potential benefits of our approach. They also show that our placement strategy can achieve near optimal placement onto various graph topologies despite the risks of local minima. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1018-4864
1572-9451
DOI:10.1023/B:TELS.0000029048.24942.65