Cryptology ePrint Archive: Report 2014/288
Resilient Aggregation in Simple Linear Sensor Networks
Kevin J. Henry and Douglas R. Stinson
Abstract: A sensor network is a network comprised of many small, wireless, resource-limited nodes that sense data about their environment and report readings to a base station. One technique to conserve power in a sensor network is to aggregate sensor readings hop-by-hop as they travel towards a base station, thereby reducing the total number of messages required to collect each sensor reading. In an adversarial setting, the ability of a malicious node to alter this aggregate total must be limited. We present three aggregation protocols inspired by three natural key pre-distribution schemes for linear networks. Assuming no more than $k$ consecutive nodes are malicious, each of these protocols limits the capability of a malicious node to altering the aggregate total by at most a single valid sensor reading. Additionally, our protocols are able to detect malicious behavior as it occurs, allowing the protocol to be aborted early, thereby conserving energy in the remaining nodes. A rigorous proof of security is also given for each protocol.
Category / Keywords: wireless sensor network, resilient aggregation, linear network, key pre-distribution
Date: received 24 Apr 2014, last revised 29 May 2014
Contact author: k2henry at uwaterloo ca
Available format(s): PDF | BibTeX Citation
Note: Small clarification on avoiding replay attacks added.
Version: 20140529:182051 (All versions of this report)
Short URL: ia.cr/2014/288
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]