Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks
Wireless sensor networks have been widely deployed for environment monitoring. The resource-limited sensor nodes usually transmit the sensing readings to Sink node collaboratively in a multihop manner to conserve energy. In this paper, we consider the problem of spatial clustering for approximate da...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-11-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/528980 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556858660880384 |
|---|---|
| author | Zhidan Liu Wei Xing Yongchao Wang Dongming Lu |
| author_facet | Zhidan Liu Wei Xing Yongchao Wang Dongming Lu |
| author_sort | Zhidan Liu |
| collection | DOAJ |
| description | Wireless sensor networks have been widely deployed for environment monitoring. The resource-limited sensor nodes usually transmit the sensing readings to Sink node collaboratively in a multihop manner to conserve energy. In this paper, we consider the problem of spatial clustering for approximate data collection that is feasible and energy-efficient for environment monitoring applications. Spatial clustering aims to group the highly correlated sensor nodes into the same cluster for rotatively reporting representative data later. Through a thorough investigation of a real-world environmental data set, we observe strong temporal-spatial correlation and define a novel similarity measure metric to inspect the similarity between any two sensor nodes, which take both magnitude and trend of their sensing readings into consideration. With such metric, we propose a clustering algorithm named as HSC to group the most similar sensor nodes in a distributed way. HSC runs on a prebuilt data collection tree, and thus gets rid of some extra requirements such as global network topology information and rigorous time synchronization. Extensive simulations based on realworld and synthetic data sets demonstrate that HSC performs superiorly in clustering quality when compared with the alternative algorithms. Furthermore, approximate data collection scheme combined with HSC can reduce much more communication overhead while incurring modest data error than with other algorithms. |
| format | Article |
| id | doaj-art-f222f644fca640999fc617d69674a614 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2013-11-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-f222f644fca640999fc617d69674a6142025-02-03T05:44:20ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-11-01910.1155/2013/528980Hierarchical Spatial Clustering in Multihop Wireless Sensor NetworksZhidan Liu0Wei Xing1Yongchao Wang2Dongming Lu3 Cyrus Tang Center for Sensor Materials and Applications, Zhejiang University, Hangzhou 310027, China Cyrus Tang Center for Sensor Materials and Applications, Zhejiang University, Hangzhou 310027, China Cyrus Tang Center for Sensor Materials and Applications, Zhejiang University, Hangzhou 310027, China Cyrus Tang Center for Sensor Materials and Applications, Zhejiang University, Hangzhou 310027, ChinaWireless sensor networks have been widely deployed for environment monitoring. The resource-limited sensor nodes usually transmit the sensing readings to Sink node collaboratively in a multihop manner to conserve energy. In this paper, we consider the problem of spatial clustering for approximate data collection that is feasible and energy-efficient for environment monitoring applications. Spatial clustering aims to group the highly correlated sensor nodes into the same cluster for rotatively reporting representative data later. Through a thorough investigation of a real-world environmental data set, we observe strong temporal-spatial correlation and define a novel similarity measure metric to inspect the similarity between any two sensor nodes, which take both magnitude and trend of their sensing readings into consideration. With such metric, we propose a clustering algorithm named as HSC to group the most similar sensor nodes in a distributed way. HSC runs on a prebuilt data collection tree, and thus gets rid of some extra requirements such as global network topology information and rigorous time synchronization. Extensive simulations based on realworld and synthetic data sets demonstrate that HSC performs superiorly in clustering quality when compared with the alternative algorithms. Furthermore, approximate data collection scheme combined with HSC can reduce much more communication overhead while incurring modest data error than with other algorithms.https://doi.org/10.1155/2013/528980 |
| spellingShingle | Zhidan Liu Wei Xing Yongchao Wang Dongming Lu Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks |
| title_full | Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks |
| title_fullStr | Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks |
| title_full_unstemmed | Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks |
| title_short | Hierarchical Spatial Clustering in Multihop Wireless Sensor Networks |
| title_sort | hierarchical spatial clustering in multihop wireless sensor networks |
| url | https://doi.org/10.1155/2013/528980 |
| work_keys_str_mv | AT zhidanliu hierarchicalspatialclusteringinmultihopwirelesssensornetworks AT weixing hierarchicalspatialclusteringinmultihopwirelesssensornetworks AT yongchaowang hierarchicalspatialclusteringinmultihopwirelesssensornetworks AT dongminglu hierarchicalspatialclusteringinmultihopwirelesssensornetworks |