Issue No. 12 - December (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.41
Ming Hua , Simon Fraser University, Burnaby
Man Ki Lau , MacDonald, Dettwiler and Associates Ltd., Richmond
Jian Pei , Simon Fraser Univeristy, Burnaby
Kui Wu , University of Victoria, Victoria
In this paper, we study an interesting problem: continuously monitoring k-means clustering of sensor readings in a large sensor network. Given a set of sensors whose readings evolve over time, we want to maintain the k-means of the readings continuously. The optimization goal is to reduce the reporting cost in the network, that is, let as few sensors as possible report their current readings to the data center in the course of maintenance. To tackle the problem, we propose the reading reporting tree, a hierarchical data collection, and analysis framework. Moreover, we develop several reporting cost-effective methods using reading reporting trees in continuous k-means monitoring. First, a uniform sampling method using a reading reporting tree can achieve good quality approximation of k-means. Second, we propose a reporting threshold method which can guarantee the approximation quality. Last, we explore a lazy approach which can reduce the intermediate computation substantially. We conduct a systematic simulation evaluation using synthetic data sets to examine the characteristics of the proposed methods.
Sensor networks, clustering, k-means, low reporting cost.
K. Wu, M. K. Lau, M. Hua and J. Pei, "Continuous K-Means Monitoring with Low Reporting Cost in Sensor Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 1679-1691, 2009.