Data Correlation-Based Clustering Algorithm in Wireless Sensor Networks

Cited 7 time in webofscience Cited 0 time in scopus
  • Hit : 347
  • Download : 0
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.
Publisher
KSII-KOR SOC INTERNET INFORMATION
Issue Date
2009
Language
English
Article Type
Article
Citation

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, v.3, no.3, pp.331 - 343

ISSN
1976-7277
DOI
10.3837/tiis.2009.03.007
URI
http://hdl.handle.net/10203/94390
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0