TY - GEN
T1 - Stochastic communication protocols for multi-agent consensus under jamming attacks
AU - Kikuchi, Kaito
AU - Cetinkaya, Ahmet
AU - Hayakawa, Tomohisa
AU - Ishii, Hideaki
N1 - Funding Information:
Kaito Kikuchi and Tomohisa Hayakawa are with the Department of Systems and Control Engineering, Tokyo Institute of Technology, Tokyo 152-8552, Japan. kikuchi@dsl.mei.titech.ac.jp, hayakawa@sc.e.titech.ac.jp Ahmet Cetinkaya and Hideaki Ishii are with the Department of Computer Science, Tokyo Insitute of Technology, Yokohama, 226-8502, Japan. ahmet@sc.dis.titech.ac.jp, ishii@c.titech.ac.jp This work was supported in part by the JST CREST Grant No. JP-MJCR15K3 and by JSPS under Grant-in-Aid for Scientific Research Grant No. 15H04020.
Publisher Copyright:
© 2017 IEEE.
PY - 2018/1/18
Y1 - 2018/1/18
N2 - A consensus problem for multi-agent systems under jamming attacks is considered. Specifically, the agents are assumed to communicate over a shared network, where transmissions may fail at certain times due to jamming. We propose stochastic communication protocols so that the agents attempt to communicate with each other at random time instants that are unknown by the attacker. We obtain sufficient finite-time practical consensus conditions. Through a probabilistic analysis, we show that our communication protocols allow consensus under a class of attacks that were previously not considered. We demonstrate the efficacy of our results by considering two different strategies of the attacker: a deterministic attack strategy and a more malicious communication-aware strategy.
AB - A consensus problem for multi-agent systems under jamming attacks is considered. Specifically, the agents are assumed to communicate over a shared network, where transmissions may fail at certain times due to jamming. We propose stochastic communication protocols so that the agents attempt to communicate with each other at random time instants that are unknown by the attacker. We obtain sufficient finite-time practical consensus conditions. Through a probabilistic analysis, we show that our communication protocols allow consensus under a class of attacks that were previously not considered. We demonstrate the efficacy of our results by considering two different strategies of the attacker: a deterministic attack strategy and a more malicious communication-aware strategy.
UR - http://www.scopus.com/inward/record.url?scp=85046294464&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046294464&partnerID=8YFLogxK
U2 - 10.1109/CDC.2017.8263888
DO - 10.1109/CDC.2017.8263888
M3 - Conference contribution
AN - SCOPUS:85046294464
T3 - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
SP - 1657
EP - 1662
BT - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 56th IEEE Annual Conference on Decision and Control, CDC 2017
Y2 - 12 December 2017 through 15 December 2017
ER -