In this letter, we consider the problem of privacy preservation in static average consensus problem. This normally is solved by proposing augmentations for popular first order Laplacian-based algorithm. These mechanisms however come with computational overhead, may need coordination among agents to choose their parameters and also alter transient response show that an alternative iterative algo...

This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...

We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve average-consensus are proposed. Necessary and sufficient communication conditions are given for each algorithm to achieve average-consensus. Resource costs for each...