Lossy data aggregation integrity scheme in wireless sensor networks

Lossy data aggregation assumes that when an aggregation node collects data from other nodes, some or all sensed data of a node may be missed. Thus the final data received by the base station are fragmented. We assume that the measurements of different nodes have different weights for their contributions to aggregated data. In this paper, we propose a secure identity-based lossy data aggregation integrity scheme based on homomorphic hashing and identity-based aggregate signature. The scheme enables the base station to share a distinct key with every sensor node, such that all aggregation nodes besides the base station can verify the authenticity of aggregated data. In our scheme, both the aggregation nodes and the base station can compute the weights of sensor nodes, neither via an established agreement nor from explicit indications attached to data. Furthermore, through theoretical analysis and experimental results, the proposed algorithm is demonstrated to have efficient performance.

Figure optionsDownload as PowerPoint slideHighlights
► We propose a novel integrity scheme for lossy data aggregation.
► We utilize homomorphic hashing function and Identity-Based Aggregate Signature scheme.
► The base station can compute the weights of sensor nodes.
► The base station can validate the integrity of data without sensor nodes’ private keys.
► Numerical results show the proposed algorithm has efficient performance.