Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.H. Bokhari: A shortest Tree Algorithm for optimal Assignments Across Space and Time in a Distributed Processor System. IEEE Transactions on Software Engineering, Vol. se-7 no. 6, November 1981.
Ph. Bonnet, J. Gehrke and P. Seshadri. Towards sensor database systems. 2nd International Conference on Mobile Data Management, Hong Kong, Jan. 2001.
N.H. Cohen, A. Purakayastha, J. Turek, L. Wong, D. Yeh. Challenges in Flexible Aggregation of Pervasive Data. IBM Research Division, January 2001.
D. Estrin, R. Govindan, and J. Heidemann. Embedding the internet: Introduction. Communications of the ACM, 43(5), 2000.
D. Estrin, M. Srivastava, and A. Sayeed. Tutorial on Wireless Sensor Networks ACM Mobicom, Sep. 2002.
J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, Deborah Estrin, and Deepak Ganesan. Building efficient wireless sensor networks with low-level naming. In SOSP, 2001.
W. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient Communication Protocol for Wireless Microsenset Network Hawaii International Conference on System Sciences, 2000.
H-U. Heiss, and M. Schmitz. Decentralized Dynamic Load Balancing: The Particles Approach. Information Sciences 84(1&2. 1995.
J. Hellerstein, W. Hong, S. Madden, and K. Stanek Beyond Average: Towards Sophisticated Sensing with Queries IPSN, 2003.
C. Intanagonwiwat, R. Govindan, D. Estrin: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks, Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (Mobicom 2000), August 2000, Boston, MA.
C. Intanagonwiwat, R. Govindan, D. Estrin, and J. Heiderman. Impact of Network Density on Data Aggregation in Wireless Sensor Networks. DEBS’02
B. Krishnamachari, D. Estrin, S. Wicker. The Impact of Data Aggregation in Wireless Sensor Networks Distributed Event Based Systems, 2002.
S. Madden, M.J. Franklin, and J. Hellerstein. TAG: a Tiny AGregation Service for Ad-Hoc Sensor Networks. OSDI, 2002.
G. J. Pottie and W. J. Kaiser. Wireless integrated network sensors. Communications of the ACM, 43(5):51–58, 2000.
S.D. Servetto, G. Barrenechea: Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks, First ACM International Workshop on Wireless Sensor Networks & Applications, September 2002, Atlanta, Georgia.
Y. Yao and J. Gehrke. Query Processing in Sensor Networks First Biennal Conference on Innovative Data Systems Research. CIDR 2003.
F. Zhao, J. Shin, and J. Reich. Information-driven dynamic sensor collaboration for tracking applications. IEEE Signal Processing Magazine, March 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonfils, B.J., Bonnet, P. (2003). Adaptive and Decentralized Operator Placement for In-Network Query Processing. In: Zhao, F., Guibas, L. (eds) Information Processing in Sensor Networks. IPSN 2003. Lecture Notes in Computer Science, vol 2634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36978-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-36978-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-02111-7
Online ISBN: 978-3-540-36978-3
eBook Packages: Springer Book Archive