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.
Type de document :
Communication dans un congrès
WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.130-137, 2012
https://hal.inria.fr/hal-00763402
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : lundi 10 décembre 2012 - 16:59:08
Dernière modification le : samedi 16 décembre 2017 - 07:18:04
Document(s) archivé(s) le : lundi 11 mars 2013 - 12:46:50
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, 2012. 〈hal-00763402〉
