Approximate Holistic Aggregation in Wireless Sensor Networks

被引:11
作者
Li, Ji [1 ]
Cheng, Siyao [2 ]
Li, Yingshu [1 ]
Cai, Zhipeng [1 ]
机构
[1] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30302 USA
[2] Harbin Inst Technol, Sch Comp Sci, Harbin 150001, Peoples R China
来源
2015 IEEE 35TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS | 2015年
关键词
D O I
10.1109/ICDCS.2015.86
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Holistic aggregation results are important for users to obtain summary information from Wireless Sensor Networks (WSNs). Holistic aggregation requires all the sensory data to be sent to the sink, which costs a huge amount of energy. Fortunately, in most applications, approximate results are acceptable. We study the approximated holistic aggregation algorithms based on uniform sampling. In this paper, four holistic aggregation operations are investigated. The mathematical methods to construct their estimators and determine the optional sample size are proposed, and the correctness of these methods is proved. Four corresponding distributed holistic algorithms are presented. The theoretical analysis and simulation results show that the algorithms have high performance.
引用
收藏
页码:740 / 741
页数:2
相关论文
共 5 条
[1]  
[Anonymous], 2005, P 2005 ACM SIGMOD IN, DOI DOI 10.1145/1066157.1066161
[2]  
[Anonymous], INFOCOM
[3]  
Cheng SY, 2009, INT CON DISTR COMP S, P273, DOI 10.1109/ICDCS.2009.8
[4]   Approximate aggregation techniques for sensor databases [J].
Considine, J ;
Li, FF ;
Kollios, G ;
Byers, J .
20TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2004, :449-460
[5]  
He Z., 2014, COCOA