TY - GEN

T1 - Broadcast gossip algorithms

AU - Aysal, Tuncer C.

AU - Yildiz, Mehmet E.

AU - Scaglione, Anna

PY - 2008/9/22

Y1 - 2008/9/22

N2 - Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and for computing in an arbitrarily connected network of nodes. Specifically, we propose a broadcasting-based gossiping algorithm to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. We show that the broadcast gossip algorithms almost surely converge to a consensus. In addition, the random consensus value is, in expectation, equal to the desired value, i.e., the average of initial node measurements. However, the broadcast gossip algorithms do not converge to the initial average in absolute sense because of the fact that the sum is not preserved at every iteration. We provide theoretical results on the mean square error performance of the broadcast gossip algorithms. The results indicate that the mean square error strictly decreases through iterations until the consensus is achieved. Finally, we assess and compare the communication cost of the broadcast gossip algorithms required to achieve a given distance to consensus through numerical simulations.

AB - Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and for computing in an arbitrarily connected network of nodes. Specifically, we propose a broadcasting-based gossiping algorithm to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. We show that the broadcast gossip algorithms almost surely converge to a consensus. In addition, the random consensus value is, in expectation, equal to the desired value, i.e., the average of initial node measurements. However, the broadcast gossip algorithms do not converge to the initial average in absolute sense because of the fact that the sum is not preserved at every iteration. We provide theoretical results on the mean square error performance of the broadcast gossip algorithms. The results indicate that the mean square error strictly decreases through iterations until the consensus is achieved. Finally, we assess and compare the communication cost of the broadcast gossip algorithms required to achieve a given distance to consensus through numerical simulations.

KW - Broadcasting

KW - Distributed average consensus

KW - Gossip algorithms

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=51849111051&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51849111051&partnerID=8YFLogxK

U2 - 10.1109/ITW.2008.4578682

DO - 10.1109/ITW.2008.4578682

M3 - Conference contribution

AN - SCOPUS:51849111051

SN - 9781424422708

T3 - 2008 IEEE Information Theory Workshop, ITW

SP - 343

EP - 347

BT - 2008 IEEE Information Theory Workshop, ITW

T2 - 2008 IEEE Information Theory Workshop, ITW

Y2 - 5 May 2008 through 9 May 2008

ER -