Nonlinear Gossip Algorithms for Wireless Sensor Networks

Abstract EN

We study some nonlinear gossip algorithms for wireless sensor networks.

Firstly, two types of nonlinear single gossip algorithms are proposed.

By using Lyapunov theory, Lagrange mean value theorem, and stochastic Lasalle’s invariance principle, we prove that the nonlinear single gossip algorithms can converge to the average of initial states with probability one.

Secondly, two types of nonlinear multigossip algorithms are also presented and the convergence is proved by the same methods.

Finally, computer simulation is also given to show the validity of the theoretical results.