Comparison of Averaging Algorithms for Wireless Sensor Networks

Performance of Gossip Algorithms in Wireless Sensor Networks

“…The elements of A, that satisfy the condition R j a ij = 1, can be chosen at random or following some suitable deterministic rule. Although different laws [11] can be adopted, in [12] we showed that good results are obtained assuming a i = 0 and:…”

Performance Evaluation of Some Distributed Averaging Algorithms for Sensor Networks

“…The performance of gossip algorithms can be measured in terms of convergence to the average [5,[16][17][18]. This subject has been widely investigated in the previous literature (see [16,[19][20][21][22][23] and the references therein), mostly under the theoretical viewpoint and by adopting abstract system models. In [16], for example, an analytical framework for the design and study of a randomized distributed averaging problem was presented, together with specific tools for network optimization.…”

Optimal Share Factors in the Push-Sum Algorithm for Ring and Random Geometric Graph Sensor Networks

“…The value of α in ( 2) has an impact on the convergence speed. Actually, in the case of fully-meshed networks, where each node is able to reach any other node in a single hop (this case is rather unrealistic but can be usefully adopted as a benchmark [11]) α ≈ 0.5 can be considered a good choice. This is confirmed, through an example, in Fig.…”

“…, is an N×N matrix whose elements are defined as follows: (11) where d i represents the nodal degree of node i. In the case of a ring topology, we have d i = d for any i.…”