Average consensus in asymmetric broadcasting wireless sensor networks through gossiping

Ferdinand Peper, Kenji Leibnitz, Tetsuya Shimokawa, Marie Ange Remiche

Research output: Contribution in Book/Catalog/Report/Conference proceedingConference contribution

Abstract

Average consensus algorithms have attracted increasing interest in the last decade because of their potential for use in high-density wireless sensor networks. This paper analyzes an algorithm that is based on a model of asymmetric broadcasting on a random geometric graph, in which nodes broadcast and listen only intermittently. We show that each node can easily estimate its update weight from the degree of silence in its neighborhood, and, after the weights have been assigned in this way, that the consensus algorithm converges to the true average. Both a synchronous and an asynchronous update model are analyzed.

Original languageEnglish
Title of host publicationAdjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016
PublisherACM Press
Pages171-176
Number of pages6
Volume28-November-2016
ISBN (Electronic)9781450347594
DOIs
Publication statusPublished - 28 Nov 2016
Event13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016 - Hiroshima, Japan
Duration: 28 Nov 20161 Dec 2016

Conference

Conference13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016
CountryJapan
CityHiroshima
Period28/11/161/12/16

Keywords

  • Average consensus
  • Gossiping algorithms
  • Wireless sensor networks

Fingerprint Dive into the research topics of 'Average consensus in asymmetric broadcasting wireless sensor networks through gossiping'. Together they form a unique fingerprint.

Cite this