An in-network approximate data gathering algorithm exploiting spatial correlation in wireless sensor networks

Authors:
Chen-Che Huang;Jiun-Long Huang;Jhih-An Yan;Lo-Yao Yeh
Affiliations:
National Chiao Tung University, Hsinchu, Taiwan, ROC;National Chiao Tung University, Hsinchu, Taiwan, ROC;National Chiao Tung University, Hsinchu, Taiwan, ROC;National Center for High-Performance Computing, Tainan, Taiwan, ROC
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 6
Cited 0

Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Snapshot Queries: Towards Data-Centric Sensor Networks

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
The Clustered AGgregation (CAG) technique leveraging spatial and temporal correlations in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation

IEEE Transactions on Parallel and Distributed Systems
Distributed spatial clustering in sensor networks

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, several studies have proposed to utilize spatial correlation of sensor readings and approximate answers to select only a subset of representative nodes for reading reporting in the WSN monitoring applications. Although having achieved substantial energy saving, these studies suffered from high control overhead or did not fully exploit spatial correlation. In this paper, we propose an in-network approximate data gathering algorithm exploiting spatial correlation. The proposed algorithm consists of two phases: in-network clustering phase and reading streaming phase. In the former phase, we present an in-network clustering scheme exploiting spatial correlations of sensor readings as well as cluster readings to further reduce the number of representative nodes. On the other hand, the latter phase employs an adaptive cluster maintenance scheme that ensures the user to obtain the reading answers of desired quality despite changing sensor readings. The experimental results show that the proposed algorithm outperforms prior algorithms in terms of network lifetime and number of representative nodes.