A novel gossip algorithm for distributed averaging with fast convergence and reduced cost of communication over wireless sensor networks (WSNs) is proposed in this paper. This algorithm is proved to improve the behaviour of the standard gossip algorithm (SGA), triplewise gossip algorithms (TGAs) and, the geographic gossip algorithm (GGA) by exploiting the geographic information of the network. An analysis of convergence time and cost of communication of the proposed algorithm is performed and a comparison with other existing methods is provided.
Key words: Wireless Sensor Networks, Distributed Computing, Distributed Processing, Gossip Algorithms, Routing.
|
