Order-Optimal Consensus Through Randomized Path Averaging

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However, for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and rando...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2010-10, Vol.56 (10), p.5150-5167
Hauptverfasser:	Bénézit, Florence, Dimakis, Alexandros G, Thiran, Patrick, Vetterli, Martin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Applied sciences Average consensus Convergence Delay distributed algorithms Distributed processing Exact sciences and technology Flooding gossip algorithms Graphs Inequalities Information processing Information theory Information, signal and communications theory Markov analysis Markov processes Messages Network topology Networks Optimization Routing sensor networks Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Topological manifolds Topology Transmission and modulation (techniques and equipments)
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!