Current approaches to handling adversary attacks againstdata aggregation in sensor networks either aim exclusively at the detec-tion of aggregate data corruption or provide rather inefficient ways toidentify the nodes captured by an adversary. In contrast, we propose adistributed algorithm for efficient identification of captured nodes over aconstant number of rounds, for an arbitrary number of captured nodes.We formulate our problem as a combinatorial group testing problem andshow that this formulation leads not only to efficient identification ofcaptured nodes but also to a precise cost-based characterization of whenin-network aggregation retains its assumed benefits in a sensor networkoperating under persistent attacks.
展开▼
