Abstract
Gossip-based protocols for group communication have attractive scalability and reliability properties. This paper presents a gossip-based protocol that enables agents to reach a consensus based on a specific uninorm aggregation operator. We theoretically analyze the convergence, the speed and the randomness features of this protocol as well as its extensions. This model can be used to handle the uncertainty and the fast convergence characteristic of collective decision dynamics. The experimental results show that this protocol is efficient, scalable, and resilient against the failures under various network sizes, and topologies. © 2012 Wiley Periodicals, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have