Name
Abstract | ||
|---|---|---|
Many types of sensor data exhibit strong correlation in both space and time. Both temporal and spatial suppressions provide opportunities for reducing the energy cost of sensor data collection. Unfortunately, existing clustering algorithms are difficult to utilize the spatial or temporal opportunities, because they just organize clusters based on the distribution of sensor nodes or the network topology but not on the correlation of sensor data. In this paper, we propose a novel clustering algorithm based on the correlation of sensor data. We modify the advertisement sub-phase and TDMA schedule scheme to organize clusters by adjacent sensor nodes which have similar readings. Also, we propose a spatio-temporal suppression scheme for our clustering algorithm. In order to show the superiority of our clustering algorithm, we compare it with the existing suppression algorithms in terms of the lifetime of the sensor network and the size of data which have been collected in the base station. As a result, our experimental results show that the size of data is reduced and the whole network lifetime is prolonged. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.3837/tiis.2009.03.007 | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS |
Keywords | Field | DocType |
Wireless sensor networks,clustering,correlation,energy-efficient,compression | Data mining,Key distribution in wireless sensor networks,CURE data clustering algorithm,Data stream clustering,Correlation clustering,Computer science,Brooks–Iyengar algorithm,Computer network,Real-time computing,Mobile wireless sensor network,Cluster analysis,Wireless sensor network | Journal |
Volume | Issue | ISSN |
3 | 3 | 1976-7277 |
Citations | PageRank | References |
11 | 1.26 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Myungho Yeo | 1 | 21 | 4.51 |
| Dongmin Seo | 2 | 49 | 10.64 |
| Jaesoo Yoo | 3 | 123 | 35.63 |