Distributed Algorithms
Threshold and Bounded-Delay Voting in Critical Control Systems
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Convex Optimization
Experience with an object reputation system for peer-to-peer filesharing
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Optimal control of LTI systems over unreliable communication links
Automatica (Journal of IFAC)
Safe and Secure Networked Control Systems under Denial-of-Service Attacks
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Redundant data transmission in control/estimation over wireless networks
ACC'09 Proceedings of the 2009 conference on American Control Conference
Spam mitigation using spatio-temporal reputations from blacklist history
Proceedings of the 26th Annual Computer Security Applications Conference
Networked Control Systems
Security based on network topology against the wiretapping attack
IEEE Wireless Communications
HMM-based characterization of channel behavior for networked control systems
Proceedings of the 1st international conference on High Confidence Networked Systems
Hi-index | 0.00 |
We examine the problem of reliable networked control when the communication channel between the controller and the actuator periodically drops packets and is faulty (i.e., corrupts/alters data). We first examine the use of a standard triple modular redundancy scheme (where the control input is sent via three independent channels) with majority voting to achieve mean square stability. While such a scheme is able to tolerate a single faulty channel when there are no packet drops, we show that the presence of lossy channels prevents a simple majority-voting approach from stabilizing the system. Moreover, the number of redundant channels that are required in order to maintain stability under majority voting increases with the probability of packet drops. We then propose the use of a reputation management scheme to overcome this problem, where each channel is assigned a reputation score that predicts its potential accuracy based on its past behavior. The reputation system builds on the majority voting scheme and improves the overall probability of applying correct (stabilizing) inputs to the system. Finally, we provide analytical conditions on the probabilities of packet drops and corrupted control inputs under which mean square stability can be maintained, generalizing existing results on stabilization under packet drops.