  In this paper, we study the problem of resilient consensus for a multi-agent
network where some of the nodes might be adversarial, attempting to prevent
consensus by transmitting faulty values. Our approach is based on that of the
so-called weighted mean subsequence reduced (W-MSR) algorithm with a special
emphasis on its use in agents capable to communicate with multi-hop neighbors.
The MSR algorithm is a powerful tool for achieving resilient consensus under
minimal requirements for network structures, characterized by the class of
robust graphs. Our analysis highlights that through multi-hop communication,
the network connectivity can be reduced especially in comparison with the
common one-hop communication case. Moreover, we analyze the multi-hop W-MSR
algorithm with delays in communication since the values from different
multi-hop neighbors may arrive at the agents at different time steps.
