LAUSR

ABSTRACT In this paper, we review some of the main discrete and finite time average consensus implementations in the literature, discussing their strengths and shortcomings from a theoretical and empirical point of view. In particular, we compare the computational characteristics of the different algorithms, their behaviour considering different underlying network topologies, their ability to withstand packet losses and their robustness to attacks where a malicious node aims to steer the result of the algorithm towards a desired value, without letting the other nodes detect the attack. Specifically, we will discuss synchronous approaches, where the nodes broadcast their messages, and asynchronous approaches, where the nodes need to be able to address their neighbours individually on a point-to-point basis (i.e. by direct communication between a specific sender and a specific receiver). With the aim to overcome some critical aspects of the considered methodologies, in this paper we present an asynchronous consensus algorithm based on a broadcast-only approach. The algorithm is characterised by a good trade-off between the robustness of synchronous approaches and to low computational demands of asynchronous methods.