An efficient distributed protocol for online gossiping problem

In this paper, we propose an efficient distributed protocol for online gossiping problem in any types of networks, especially for mobile networks and fault-tolerant networks. The nodes in the networks have limited information of the entire network. Each node knows its neighboring nodes. The proposed gossiping protocol is fully distributed and tolerates node or link failures as well as topology changes (mobility). We show that the protocol completes in O(n²) time in any types of networks, even when the networks contain multiple failures.