Bernoulli sampling based (ε, δ)-approximate aggregation in large-scale sensor networks

  • Authors:
  • Siyao Cheng;Jianzhong Li;Qianqian Ren;Lei Yu

  • Affiliations:
  • Harbin Institute of Technology, China;Harbin Institute of Technology, China;Harbin Institute of Technology, China;Harbin Institute of Technology, China

  • Venue:
  • INFOCOM'10 Proceedings of the 29th conference on Information communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Aggregations of sensed data are very important for users to get summary information about monitored area in applications of wireless sensor networks (WSNs). As the approximate aggregation results are enough for users to perform analysis and make decisions, many approximate aggregation algorithms are proposed for WSNs. However, most of the algorithms have fixed error bounds and cannot meet arbitrary precision requirement, the uniform sampling based algorithm which can reach arbitrary precision is just suitable for the static networks. Considering the dynamic property of WSNs, in this paper, we propose an approximate aggregation algorithm based on Bernoulli sampling to satisfy arbitrary precision requirement. Besides, two adaptive algorithms are also proposed, one is for adapting the sample with varying of precision requirement, the other is for adapting the sample with varying of sensed data. The theoretical analysis and experiment results show that the proposed algorithms have high performance in terms of accuracy and energy consumption.