Greedy gossip with eavesdropping

TitleGreedy gossip with eavesdropping
Publication TypeConference Proceedings
Year of Publication2008
AuthorsÜstebay, D., M. J. Coates, and M. G. Rabbat
Conference Name3rd International Symposium on Wireless Pervasive Computing (ISWPC)
Pagination759-763
Date PublishedMay 2008
Conference LocationSantorini, Greece
Keywordsaverage consensus algorithm, eavesdropping, geographic gossip, greedy gossip, network topology, randomized gossip, wireless sensor network
Abstract

This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recently received much attention in the sensor network community because of their simplicity and completely decentralized nature which makes them robust to changes in the network topology and unreliable wireless networking environments. In the sensor network, each node has a measurement value and the aim of average consensus is computing the average of these node values in the absence of a central authority. We prove that GGE converges to the average consensus with probability one. We also illustrate the performance of the algorithm via simulations and conclude that GGE provides a significant performance improvement compared to existing average consensus algorithms such as randomized gossip and geographic gossip.

DOI10.1109/ISWPC.2008.4556312
Refereed DesignationRefereed