Stability Of Consensus Protocol Research Articles

On Exponential Almost Sure Stability of Consensus Algorithm in State Dependent and Switching Networks

In many network applications the connectivity between nodes can be state dependent (i.e. in wireless and swarming networks the strength of node interaction depends on the distance between the agents) or can be switching (i.e. due to link failure or link creation). This note is concerned with the analysis of consensus problem and the design of network/protocol parameters in networks with Markov switching topology and state dependent connectivity. In particular a sufficient condition for exponential almost sure stability of consensus protocol is given. The stability condition validation is presented by numerical simulations.