Greedy Gossip Algorithm with Synchronous Communication for Wireless Sensor Networks

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

14 Downloads (Pure)

Abstract

Randomized gossip (RG) based distributed averaging has been popular for wireless sensor networks (WSNs) in multiple areas. With RG, randomly two adjacent nodes are selected to communicate and exchange information iteratively until consensus is reached. One way to improve the convergence speed of RG is to use greedy gossip with eavesdropping (GGE). Instead of randomly selecting two nodes, GGE selects the two nodes based on the maximum difference between nodes in each iteration. To further increase the convergence speed in terms of transmissions, we present in this paper a synchronous version of the GGE algorithm, called greedy gossip with synchronous communication (GGwSC). The presented algorithm allows multiple node pairs to exchange their values synchronously. Because of the selection criterion of the maximum difference between the values at the nodes, there is at least one node pair with different information, such that the relative error must be reduced after each iteration. The convergence rate in terms of the number of transmissions is demonstrated to be improved compared to GGE. Experimental results validate that the proposed GGwSC is quite e↵ective for the random geometric graph (RGG) as well as for several other special network topologies.
Original languageEnglish
Title of host publicationProceedings of the 37th WIC Symposium on Information Theory in the Benelux and The 6th Joint WIC/IEEE Symposium on Information Theory and Signal Processing in the Benelux
EditorsF. Glineur, J. Louveaux
PublisherUniversité Catholique de Louvain, Belgium
Pages227-235
Number of pages8
ISBN (Electronic)978-2-9601884-0-0
Publication statusPublished - 2016
Event37th WIC Symposium on Information Theory in the Benelux / 6th WIC/IEEE SP Symposium on Information Theory and Signal Processing in the Benelux - Université Catholique de Louvain, Louvain, Belgium
Duration: 19 May 201620 May 2016
http://sites.uclouvain.be/sitb2016/

Conference

Conference37th WIC Symposium on Information Theory in the Benelux / 6th WIC/IEEE SP Symposium on Information Theory and Signal Processing in the Benelux
CountryBelgium
CityLouvain
Period19/05/1620/05/16
Internet address

Fingerprint Dive into the research topics of 'Greedy Gossip Algorithm with Synchronous Communication for Wireless Sensor Networks'. Together they form a unique fingerprint.

  • Cite this

    Zhang, J., Hendriks, R. C., & Heusdens, R. (2016). Greedy Gossip Algorithm with Synchronous Communication for Wireless Sensor Networks. In F. Glineur, & J. Louveaux (Eds.), Proceedings of the 37th WIC Symposium on Information Theory in the Benelux and The 6th Joint WIC/IEEE Symposium on Information Theory and Signal Processing in the Benelux (pp. 227-235). Université Catholique de Louvain, Belgium.