A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks

Authors:
Shreyas Sundaram;Shai Revzen;George Pappas
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, N2L 3G1, Canada;GRASP Laboratory and the Department of Electrical and Systems Engineering, University of Pennsylvania, PA 19104, USA;GRASP Laboratory and the Department of Electrical and Systems Engineering, University of Pennsylvania, PA 19104, USA
Venue:
Automatica (Journal of IFAC)
Year:
2012

Citing 11
Cited 0

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Broadcast in radio networks tolerating byzantine adversarial behavior

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Network coding theory: single sources

Communications and Information Theory
A Survey of Botnet Technology and Defenses

CATCH '09 Proceedings of the 2009 Cybersecurity Applications & Technology Conference for Homeland Security
Consensus of multi-agent networks in the presence of adversaries using only local information

Proceedings of the 1st international conference on High Confidence Networked Systems
Survey Generic properties and control of linear structured systems: a survey

Automatica (Journal of IFAC)
Algebraic gossip: a network coding approach to optimal multiple rumor mongering

IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries

IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
Computing and communicating functions over sensor networks

IEEE Journal on Selected Areas in Communications
Distributed function calculation and consensus using linear iterative strategies

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	22.14

Visualization

Abstract

We consider a network in which every node has a value that it wishes to disseminate to all other nodes, despite an attack by an adversary that can falsify messages on a number of the links. To achieve this objective, we study a class of linear iterative strategies in which, at each time-step, each node in the network broadcasts a value to its neighbors that is a linear combination of its previous value and the values received from its neighbors. We take the number of unreliable links to be bounded, in that the number of incoming unreliable links to any node plus the total number of other nodes with incoming unreliable links is no greater than some nonnegative integer f. We show that the linear iterative strategy will be resilient to the unreliable links if and only if the vertex connectivity is at least 2f+1. If this condition is satisfied, we show that almost any choice of weights in the linear combinations will suffice to provide resilience. We further show that each node can identify the exact set of unreliable links that directly enter that node, and can communicate this information to the other nodes via the linear strategy.