Skip to Main content Skip to Navigation
Conference papers

Nomographic Gossiping for f-Consensus

Abstract : 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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Monday, December 10, 2012 - 4:59:08 PM
Last modification on : Thursday, January 6, 2022 - 11:38:04 AM
Long-term archiving on: : Monday, March 11, 2013 - 12:46:50 PM


Explicit agreement for this submission


  • 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⟩



Record views


Files downloads