Secure and Efficient Data Aggregation for Wireless Sensor Networks

This paper addresses the secure data aggregation for wireless sensor networks (WSNs) with both static tree architecture and dynamic cluster-based architecture. For WSNs with static tree architecture, we propose the Leaf Node Representation (LNR) scheme to solve the Id problem and make the key stream-based encrypted data aggregation feasible and practical for large scale networks. For WSNs with dynamic cluster-based architectures, we propose the Delayed Hop-by-hop Authentication (DHA) scheme to provide hop-by-hop data integrity and data freshness only using individual keys. Analytical results show that the proposed scheme can reduce the communication overhead significantly compared to a well known existing scheme.