Nomographic Gossiping for f-Consensus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Nomographic Gossiping for f-Consensus


In this paper, we present a novel class of iterative gossip algorithms called nomographic gossiping that partly allow to efficiently achieve a rapid global consensus among nodes/agents in a clustered wireless network with respect to an arbitrary function of the initial states. The algorithms are based on the surprising fact that every real-valued multivariate function has a nomographic representation, which is simply a function of a superposition of a finite number of univariate functions. Since superpositions can be effectively generated via the wireless channel by letting nodes in a cluster transmit simultaneously their pre-processed states to a cluster head, the convergence speed can be significantly increased provided that some connectivity condition between clusters is fulfilled.
Fichier principal
Vignette du fichier
p130-goldenbaum.pdf (582.09 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00763402 , version 1 (10-12-2012)


  • HAL Id : hal-00763402 , version 1


Mario Goldenbaum, Holger Boche, Sławomir Stanczak. Nomographic Gossiping for f-Consensus. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.130-137. ⟨hal-00763402⟩


68 View
215 Download


Gmail Facebook X LinkedIn More