文档介绍：Abstract
Wireless work(WSN) has attracted more and more researchers in recent posed of a large number of low-cost microsensors nodes and formed a multi-hop anizing system through munication can real-time collaborate,collect ,transmit and process perceived object information in areas and send data information to the relevant has low cost, low power consumption, high fault tolerance, strong real-time performance,etc. Therefore,WSN has great applicaion value ,which can be used in military application,medical health,building security monitoring and other aspects of application.
Gossip algorithms are simple and efficient, similar to the spread of viral transmission are kinds munication mode through choosing a nearby node for exchanging munication according to their requirements. Instead of the end-to-end routing, Gossip algorithms have advantages of decentralization, strong expansibility and so on. Gossip algorithms are more suitable for distributed wireless works because congestion and link failure can be efficiently resisted.
In this paper, we develop distributed gossip algorithms for quantized consensus. In the distributed systems such as wireless works, distributed consensus problem based on Gossip algorithms has been widely used. There are many research results of pairwise gossip algorithms, which have slow rate of convergence and only availability in symmetrical link. But in recent years, the proposed broadcast Gossip algorithms can make full use of the radio characteristics of wireless channel. At the same time, They are suitable for asymmetric-works thereby improving the convergence speed greatly. However, in putation process of Gossip algorithms,there will usually be a decimal even irrational number. Therefore, quantization for broadcast Gossiop algorithms has significant use value.
We first introduced the work process, characteristics and applications of Gossip algorithms. Respectively for classical pairwire gossip