Adaptive and decentralized operator placement for in-network query processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2634, Issue , 2003, Pages 47-62

  Bonfils, Boris Jan ^a   Bonnet, Philippe ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; QUERY PROCESSING; SENSOR NETWORKS; SENSOR NODES; TOPOLOGY;

DECENTRALIZED ALGORITHMS; IN-NETWORK QUERY PROCESSING; NETWORK TRAFFIC; OPERATOR PLACEMENTS; PLACEMENT STRATEGY; POLYNOMIAL ALGORITHM; POTENTIAL BENEFITS; TASK ASSIGNMENT;

TREES (MATHEMATICS);

EID: 33646409376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36978-3_4     Document Type: Article

References (17)

1. 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.
2. Ph. Bonnet, J. Gehrke and P. Seshadri. Towards sensor database systems. 2nd International Conference on Mobile Data Management, Hong Kong, Jan. 2001.
3. N.H. Cohen, A. Purakayastha, J. Turek, L. Wong, D. Yeh. Challenges in Flexible Aggregation of Pervasive Data. IBM Research Division, January 2001.
4. D. Estrin, R. Govindan, and J. Heidemann. Embedding the internet: Introduction. Communications of the ACM, 43(5), 2000.
5. D. Estrin, M. Srivastava, and A. Sayeed. Tutorial on Wireless Sensor Networks ACM Mobicom, Sep. 2002.
6. 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.
7. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient Communication Protocol for Wireless Microsenset Network Hawaii International Conference on System Sciences, 2000.
8. H-U. Heiss, and M. Schmitz. Decentralized Dynamic Load Balancing: The Particles Approach. Information Sciences 84(1&2. 1995.
9. J. Hellerstein, W. Hong, S. Madden, and K. Stanek Beyond Average: Towards Sophisticated Sensing with Queries IPSN, 2003.
10. 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.
11. C. Intanagonwiwat, R. Govindan, D. Estrin, and J. Heiderman. Impact of Network Density on Data Aggregation in Wireless Sensor Networks. DEBS'02
12. B. Krishnamachari, D. Estrin, S. Wicker. The Impact of Data Aggregation in Wireless Sensor Networks Distributed Event Based Systems, 2002.
13. S. Madden, M.J. Franklin, and J. Hellerstein. TAG: a Tiny AGregation Service for Ad-Hoc Sensor Networks. OSDI, 2002.
14. G. J. Pottie and W. J. Kaiser. Wireless integrated network sensors. Communications of the ACM, 43(5):51-58, 2000.
15. 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.
16. Y. Yao and J. Gehrke. Query Processing in Sensor Networks First Biennal Conference on Innovative Data Systems Research. CIDR 2003.
17. F. Zhao, J. Shin, and J. Reich. Information-driven dynamic sensor collaboration for tracking applications. IEEE Signal Processing Magazine, March 2002.