Resilient Multi-Agent Consensus Using Wi-Fi Signals

Consensus is an important capability at the heart of many multi-agent systems. Unfortunately the ability to reach consensus can be easily disrupted by the presence of an adversarial agent that spawns or spoofs malicious nodes in the network in order to gain a disproportionate influence on the converged value of the system as a whole. In this letter, we present a light-weight approach for spoof-resiliency with provable guarantees that solely utilizes information from wireless signals. Unlike prior approaches, our method requires no additional protocol or data storage beyond signals that are already present in the network. We establish an analytical, probabilistic bound on the influence of spoofed nodes in the system on the converged consensus value. We present results of our Wi-Fi based resilient consensus algorithm and demonstrate its effectiveness for different consensus problems such as flocking and rendezvous.

[1]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

[2]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[3]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[4]  Vijay Kumar,et al.  Resilient Flocking for Mobile Robot Teams , 2017, IEEE Robotics and Automation Letters.

[5]  Allan Tomlinson,et al.  Modelling malicious entities in a robotic swarm , 2013, 2013 IEEE/AIAA 32nd Digital Avionics Systems Conference (DASC).

[6]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[7]  Swarun Kumar,et al.  Accurate indoor localization with zero start-up cost , 2014, MobiCom.

[8]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[9]  John N. Tsitsiklis,et al.  Some aspects of parallel and distributed iterative algorithms - A survey, , 1991, Autom..

[10]  Leslie Lamport,et al.  Paxos Made Simple , 2001 .

[11]  E. Polak,et al.  Discrete-Time Systems: An Introduction to the Theory. Herbert Freeman. Wiley, New York, 1965. xiv + 241 pp. Illus. $10 , 1965 .

[12]  Leslie Lamport,et al.  Fast Paxos , 2006, Distributed Computing.

[13]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[14]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[15]  Swarun Kumar,et al.  Guaranteeing spoof-resilient multi-robot networks , 2015, Auton. Robots.

[16]  Bo Sheng,et al.  Verifiable Privacy-Preserving Range Query in Two-Tiered Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[18]  Allan Tomlinson,et al.  Threats to the Swarm: Security Considerations for Swarm Robotics , 2009 .

[19]  Srdjan Capkun,et al.  Investigation of multi-device location spoofing attacks on air traffic control and possible countermeasures , 2016, MobiCom.

[20]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[21]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[22]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[23]  Swarun Kumar,et al.  Adaptive communication in multi-robot systems using directionality of signal strength , 2015, Int. J. Robotics Res..