Clustering distributed sensor data streams using local processing and reduced communication

Issue title: Ubiquitous Knowledge Discovery

Guest editors: João Gamax and Michael Mayy

Article type: Research Article

Authors: Gama, João^{a; d; *} | Rodrigues, Pedro Pereira^{a; b; c} | Lopes, Luís^{b; e}

Affiliations: [a] LIAAD, University of Porto, Porto, Portugal | [b] Faculty of Sciences, University of Porto, Porto, Portugal | [c] Faculty of Medicine, University of Porto, Porto, Portugal | [d] Faculty of Economics, University of Porto, Porto, Portugal | [e] CRACS – INESC, Porto, Portugal | [x] LIAAD, University of Porto, Porto, Portugal | [y] Fraunhofer IAIS, Sankt Augustin, Germany

Correspondence: [*] Corresponding author: João Gama, LIAAD – INESC Porto L.A. Rua de Ceuta, 118-6 andar, 4050-190, Porto, Portugal. E-mail: jgama@fep.up.pt.

Abstract: Nowadays applications produce infinite streams of data distributed across wide sensor networks. In this work we study the problem of continuously maintain a cluster structure over the data points generated by the entire network. Usual techniques operate by forwarding and concentrating the entire data in a central server, processing it as a multivariate stream. In this paper, we propose DGClust, a new distributed algorithm which reduces both the dimensionality and the communication burdens, by allowing each local sensor to keep an online discretization of its data stream, which operates with constant update time and (almost) fixed space. Each new data point triggers a cell in this univariate grid, reflecting the current state of the data stream at the local site. Whenever a local site changes its state, it notifies the central server about the new state it is in. This way, at each point in time, the central site has the global multivariate state of the entire network. To avoid monitoring all possible states, which is exponential in the number of sensors, the central site keeps a small list of counters of the most frequent global states. Finally, a simple adaptive partitional clustering algorithm is applied to the frequent states central points in order to provide an anytime definition of the clusters centers. The approach is evaluated in the context of distributed sensor networks, focusing on three outcomes: loss to real centroids, communication prevention, and processing reduction. The experimental work on synthetic data supports our proposal, presenting robustness to a high number of sensors, and the application to real data from physiological sensors exposes the aforementioned advantages of the system.

Keywords: Online adaptive clustering, distributed data streams, sensor networks, incremental discretization, frequent items monitoring

DOI: 10.3233/IDA-2010-0453

Journal: Intelligent Data Analysis, vol. 15, no. 1, pp. 3-28, 2011