The Community for Technology Leaders
RSS Icon
Subscribe
Mar. 25, 2008 to Mar. 28, 2008
ISBN: 978-0-7695-3096-3
pp: 634-638
ABSTRACT
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as acore task of mining sensor data plays an essential role in analytical applications of sensor networks. Although several algorithms have been proposed to address the problem of distributed clustering, in the domain of sensor networks these algorithms face major new challenges such as limited communication bandwidth and constraints in power supply, and storage resources. Moreover, previous studies about clustering in sensor networks have mostly focused on clustering sensor nodes and designing better network topology for the purpose of energy conservation rather than clustering sensor data for future analytical purposes. In this paper a communication efficient distributed algorithm is proposed for clustering sensory data. This approach addresses the limited bandwidth issue through summarized transmissions. Furthermore, communication efficiency of the algorithm contributes to reduced power consumption. Time efficiency of the algorithm is evaluated through simulation experiments and the results are presented.
INDEX TERMS
Sensor Networks, Clustering, Data Mining
CITATION
Amirhosein Taherkordi, Reza Mohammadi, Frank Eliassen, "A Communication-Efficient Distributed Clustering Algorithm for Sensor Networks", AINAW, 2008, Advanced Information Networking and Applications Workshops, International Conference on, Advanced Information Networking and Applications Workshops, International Conference on 2008, pp. 634-638, doi:10.1109/WAINA.2008.130
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool