Distributed Spatial Clustering in Sensor Networks

Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying data distribution. Such data characteristics can be efficiently extracted through spatial clustering, which partitions the network into a set of spatial regions with similar observations. The goal of this paper is to perform such a spatial clustering, specifically -clustering, where the data dissimilarity between any two nodes inside a cluster is at most . We present an in-network clustering algorithm ELink that generates good -clusterings for both synchronous and asynchronous networks in O( N log N) time and in O(N) message complexity, where N denotes the network size. Experimental results on both real world and synthetic data sets show that ELink's clustering quality is comparable to that of a centralized algorithm, and is superior to other alternative distributed techniques. Furthermore, ELink performs ...

• Type: Conference
• Year: 2006
• Where: EDBT
• Authors: Anand Meka, Ambuj K. Singh
• Keywords: Database, EDBT 2006, In-network Clustering Algorithm, In-network Distributed Algorithms, Spatial Clustering