The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2007)
Hsinchu, Taiwan
Dec. 5, 2007 to Dec. 7, 2007
ISBN: 978-1-4244-1889-3
pp: 1-8
null Ying Li , Caulfield School of Information Technology, Monash University, Australia
Seng W. Lokey , Department of Computer Science and Computer Engineering, La Trobe University, Australia
M. V. Ramakrishna , Caulfield School of Information Technology, Monash University, Australia
ABSTRACT
Reducing amount of data transmitted enables conserving scarce battery power in wireless sensor networks. In our previous work, we propose two data approximation algorithms for data reduction in sensor networks, maintaining the accuracy of query results within certain bounds. In this paper, we provide a performance study and analysis of these algorithms with emphasis on the types of data for which the algorithms are appropriate. We experimented with different data sets to determine the reduction ratios achieved , energy consumed, errors introduced, complexity of query answering obtained.We provide comparison of our algorithms with related methods. The presented results indicate the superiority of our methods in terms of data reduction and accuracy of query results.
INDEX TERMS
null
CITATION

M. V. Ramakrishna, n. Ying Li and S. W. Lokey, "Performance study of data stream approximation algorithms in wireless sensor networks," Parallel and Distributed Systems, International Conference on(ICPADS), Hsinchu, Taiwan, 2007, pp. 1-8.
doi:10.1109/ICPADS.2007.4447740
87 ms
(Ver 3.3 (11022016))