A. Rabkin and R. Katz, Chukwa: a system for reliable large-scale log collection, Proceedings of the International Conference on Large Installation System Administration (LISLA), 2010.

Y. Zhao, Y. Tan, Z. Gong, X. Gu, and M. Wamboldt, Self-correlating predictive information tracking for large-scale production systems, Proceedings of the 6th international conference on Autonomic computing, ICAC '09, 2009.
DOI : 10.1145/1555228.1555235
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.404.932

A. Desphand, E. Guestrin, and S. Madden, Model-driven data acquisition in sensor networks, Proceedings of the International Conference on Very Large Databases (VLDB, 2002.

S. Krishnamurthy, T. He, G. Zhou, J. A. Stankovic, and S. H. Son, RESTORE: A Real-time Event Correlation and Storage Service for Sensor Networks, Proceedings of the International Conference on Network Sensing Systems (INSS), 2006.

M. C. Vuran and I. F. Akyildiz, Spatial correlation-based collaborative medium access control in wireless sensor networks, IEEE/ACM Transactions on Networking, vol.14, issue.2, pp.316-329, 2006.
DOI : 10.1109/TNET.2006.872544

R. E. Kalman, A New Approach to Linear Filtering and Prediction Problems, Journal of Basic Engineering, vol.82, issue.1, pp.35-45, 1960.
DOI : 10.1115/1.3662552

X. Xiong, M. Mokbel, and W. Aref, SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-Temporal Databases, Proceedings of the IEEE International Conference on Data Engineering (ICDE), 2005.

K. Mouratidis, D. Papadias, S. Bakiras, and Y. Tao, A threshold-based algorithm for continuous monitoring of k nearest neighbors, IEEE Transactions on Knowledge and Data Engineering, vol.17, issue.11, pp.1451-1464, 2005.
DOI : 10.1109/TKDE.2005.172

Z. Zhang, Y. Yang, A. K. Tung, and D. Papadias, Continuous k-Means Monitoring over Moving Objects, IEEE Transactions on Knowledge and Data Engineering, vol.20, issue.9, pp.1205-1216, 2008.
DOI : 10.1109/TKDE.2008.54

S. Har-peled and B. Sadri, How fast is the k-means method? Algorithmica, pp.185-202, 2005.
DOI : 10.1007/s00453-004-1127-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.3950

S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker, A scalable content-addressable network, Proceedings of the SIG- COMM Conference, 2001.
DOI : 10.1145/964723.383072
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.1538

I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the SIGCOMM Conference, 2001.

J. Lin, Broadcast Scheduling for a P2P Spanning Tree, 2008 IEEE International Conference on Communications, 2008.
DOI : 10.1109/ICC.2008.1052

B. Kovacs and R. Vida, An Adaptive Approach to Enhance the Performance of Content-Addressable Networks, International Conference on Networking and Services (ICNS '07), 2007.
DOI : 10.1109/ICNS.2007.27

E. Anceaume, R. Ludinard, A. Ravoaja, and F. V. Brasileiro, PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008.
DOI : 10.1109/SASO.2008.44