An efficient integrity-preserving scheme for hierarchical sensor aggregation

  • Authors:
  • Keith B. Frikken;Joseph A. Dougherty, IV

  • Affiliations:
  • Miami University, Oxford, OH;Miami University, Oxford, OH

  • Venue:
  • WiSec '08 Proceedings of the first ACM conference on Wireless network security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sensor networks have proven to be useful in many application domains. Having the sensor nodes aggregate their results inside the network before sending the results to a base station has been shown to increase the lifetime of the network. However, sensor networks that are deployed in hostile environments need aggregation protocols that protect the integrity of the result. Recently, Chan et al. [3] introduced such a scheme that requires O(Δlog2n) communication per node, where Δ$ is the degree of the aggregation tree for the network and n is the number of nodes in the network. In this paper, we introduce modifications of this approach that reduce the maximum communication per node to O(Δlog2n).