Filters








111,710 Hits in 4.8 sec

Reaching a stochastic consensus in the noisy networks of linear MIMO agents: Dynamic output-feedback and convergence rate

YunPeng Wang, Long Cheng, ChenGuang Yang, ZengGuang Hou, Min Tan
2015 Science China Technological Sciences  
Reaching a stochastic consensus in the noisy networks of linear MIMO agents: Dynamic output-feedback and convergence rate.  ...  It turns out that all followers' states converge to the leader's state in the mean square sense at a rate of O(t  ). multi-agent system, mean square consensus, communication noise, noise-attenuation  ...  Furthermore, the consensus errors have a convergence rate of 25/(t+1) 0.7 , which aligns with the results given in Theorem 4.1.  ... 
doi:10.1007/s11431-015-5975-0 fatcat:wmizibpshfeklbchyqiv7j3u64

Resilience of IOTA Consensus [article]

Hamed Mamache
2022 arXiv   pre-print
In this paper we investigate the convergence of IOTA consensus algorithms: Fast Probabilistic Consensus and Cellular Consensus, when run on top of various topologies.  ...  Our extensive simulations show that both Cellular Consensus and Fast Probabilistic Consensus have poor convergence rates even under low power adversaries and have poor scaling performances except for the  ...  In terms of network size, for the Grid and the Torus topologies, the more nodes are in network, the lower convergence rate is. Hence, Fast Probabilistic Consensus is not scalable.  ... 
arXiv:2111.07805v3 fatcat:lmh747fzfjgxnoyfy2yt7uljey

Optimal Memory Scheme for Accelerated Consensus Over Multi-Agent Networks [article]

Jiahao Dai, Jing-Wen Yi, Li Chai
2021 arXiv   pre-print
(ii) In the worst case, we prove that it is a vain to add any tap of the state deviation memory, and the one-tap node memory is sufficient to achieve the optimal convergence.  ...  In this paper, a more general protocol with the node memory and the state deviation memory is designed. We aim to provide the optimal memory scheme to accelerate consensus.  ...  Convergence rate is an important performance indicator of consensus. Optimizing the weight of the network [14] - [17] is a effective method to accelerate the consensus. Xiao et al.  ... 
arXiv:2112.07108v1 fatcat:iwob4bj32fh7lgp2cmkcd46vwq

Analysis of Average Consensus Algorithm for Asymmetric Regular Networks [article]

Sateeshkrishna Dhuli, Y. N. Singh
2018 arXiv   pre-print
Further, we study the effect of asymmetric links, the number of nodes, network dimension, and node overhead on the convergence rate of average consensus algorithms.  ...  Average consensus algorithms compute the global average of sensor data in a distributed fashion using local sensor nodes.  ...  Organization 1)In section II, we give a brief review on consensus algorithms 2)In section III, we model the WSN as a ring and derive the explicit expressions of convergence rate in terms of number of nodes  ... 
arXiv:1806.03932v2 fatcat:maxsarz7g5dt7iak6bu6s4ldim

Polynomial Filtering for Fast Convergence in Distributed Consensus

E. Kokiopoulou, P. Frossard
2009 IEEE Transactions on Signal Processing  
In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks.  ...  The main idea of the proposed methodology is to apply a polynomial filter on the network matrix that will shape its spectrum in order to increase the convergence rate.  ...  Exploiting Memory As we have seen above, the convergence rate of the distributed consensus algorithms depends in general on the spectral properties of an induced network matrix.  ... 
doi:10.1109/tsp.2008.2006147 fatcat:6od7j52yfnge7n47gqo4ctzdlq

Optimal polynomial filtering for accelerating distributed consensus

Effrosyni Kokiopoulou, Pascal Frossard, Dimitra Gkorou
2008 2008 IEEE International Symposium on Information Theory  
In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks.  ...  The main idea of the proposed methodology is to apply a polynomial filter on the network matrix that will shape its spectrum in order to increase the convergence rate.  ...  Exploiting Memory As we have seen above, the convergence rate of the distributed consensus algorithms depends in general on the spectral properties of an induced network matrix.  ... 
doi:10.1109/isit.2008.4595068 dblp:conf/isit/KokiopoulouFG08 fatcat:44fqtsq4pbbj5nzuh6koo4w65m

A Cluster-Based Consensus Algorithm in a Wireless Sensor Network

Yanwei Li, Zhenyu Zhou, Takuro Sato
2013 International Journal of Distributed Sensor Networks  
a certain phenomenon in a distributed network.  ...  In this paper, we propose an average connectivity degree cluster (ACDC) scheme gossip algorithm to improve the convergence speed and the accuracy of the consensus, when a common decision is needed for  ...  The consensus value and the relative error vary with different initialization values. In Figure 5 , the convergence rates based on a C-shaped network topology are illustrated.  ... 
doi:10.1155/2013/547124 fatcat:gh3uwo6wfzhotos7ogcg2tlg6m

Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study [chapter]

Alexander Gogolev, Christian Bettstetter
2012 Lecture Notes in Computer Science  
Gacs-Kurdyumov-Levin and simple majority rule are evaluated in terms of convergence rate and speed as a function of noise and network topology.  ...  This short paper studies distributed consensus algorithms with focus on their robustness against communication errors. We report simulation results to verify and assess existing algorithms.  ...  As performance metrics we measure the convergence rate (fraction of converged networks out of 1 000 simulations) and convergence speed (number of steps until network converges to a single state normalized  ... 
doi:10.1007/978-3-642-28583-7_11 fatcat:747cq6f6pzaklaaou4fz26ybla

Convergence rates of consensus algorithms in stochastic networks

Stacy Patterson, Bassam Bamieh
2010 49th IEEE Conference on Decision and Control (CDC)  
We study the convergence rate of average consensus algorithms in networks with stochastic communication failures.  ...  We also show that in large networks, when the probability of communication failure is small, correlation in communication failures plays a negligible role in the convergence rate of the algorithm. 49th  ...  However, the study of convergence rates in such networks is a less mature area.  ... 
doi:10.1109/cdc.2010.5717338 dblp:conf/cdc/PattersonB10a fatcat:yvcxb7utzrh7zdiet2d7receb4

Convergence of consensus filtering under network throughput limitations

Yashan Sun, Michael D. Lemmon
2007 2007 46th IEEE Conference on Decision and Control  
In [3] , it is shown that the convergence rate is proportional to the connectivity of the communication network.  ...  Consensus filters [1] provide a distributed way of computing data aggregates in embedded sensor networks.  ...  Since these roots are a function of the network connectivity Δ, we can see that the consensus filter's convergence rate is also a function of Δ.  ... 
doi:10.1109/cdc.2007.4434481 dblp:conf/cdc/SunL07 fatcat:sgvnggw3ojfubien5526w2htru

Monotonic Mean-Squared Convergence Conditions for Random Pairwise Consensus Synchronization in Wireless Networks

D. Richard Brown, Andrew G. Klein, Rui Wang
2015 IEEE Transactions on Signal Processing  
This paper analyzes the problem of synchronizing nodes in a time-division-duplexed wireless network via consensus methods using only acknowledged message exchanges over existing network traf¿c.  ...  To characterize both transient and asymptotic consensus behavior, general results are presented providing necessary and suf¿cient conditions for monotonic mean squared convergence of a distance from consensus  ...  Dasgupta from the University of Iowa as well as the anonymous reviewers for their valuable comments and suggestions to improve the quality and clarity of this manuscript.  ... 
doi:10.1109/tsp.2014.2386280 fatcat:3vwk4zm3brcnrblsxe6lsu27sy

Sensor Networks With Random Links: Topology Design for Distributed Consensus

S. Kar, J.M.F. Moura
2008 IEEE Transactions on Signal Processing  
sure (a.s.) convergence of average consensus when network links fail; and, in particular, (3) show that a necessary and sufficient condition for both mss and a.s. convergence is for the algebraic connectivity  ...  The paper studies the problem of designing the topology, i.e., assigning the probabilities of reliable communication among sensors (or of link failures) to maximize the rate of convergence of average consensus  ...  CONCLUSION The paper presents the design of the topology of a random sensor network to maximize the convergence rate of the consensus algorithm.  ... 
doi:10.1109/tsp.2008.920143 fatcat:kz6x7fjhbzfftdmjppxi5ost5q

Trading accuracy for speed in approximate consensus

Jacob Beal
2016 Knowledge engineering review (Print)  
by sending values across long distances using a self-organizing overlay network.  ...  Comparing Laplacian-based consensus to exact consensus algorithms, relaxing the requirements for accuracy and resilience should enable a spectrum of algorithms that incrementally tradeoff accuracy and/  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA  ... 
doi:10.1017/s0269888916000175 fatcat:4ciyfkjjffd6rfsqc5vlnsy6xe

Performance Analysis of Distributed Consensus on Regular Networks

Bo Yang, Feng-Hua Zhao
2012 Systems Engineering Procedia  
This paper presents the analysis of the performance of the consensus on regular network structures in information engineering.  ...  By graph Laplacian spectrum and frequency domain analysis, the performance of the consensus, characterized by the convergence rate and robustness to the communication constraints, are investigated in details  ...  Now we are ready to give our main results in the following. Convergence rate The performance of the convergence rate of the consensus protocol for regular graphs is summarized in the following.  ... 
doi:10.1016/j.sepro.2011.11.035 fatcat:kux2vnojynd6rilof6hjywecvy

Effect of nonuniform varying delay on the rate of convergence in averaging-based consensus

Onur CİHAN, Mehmet AKAR
2015 Turkish Journal of Electrical Engineering and Computer Sciences  
This paper discusses the effect of nonuniform varying communication delay on distributed consensus algorithms in discrete time.  ...  It is shown theoretically that nonuniform delay is not detrimental to the convergence rate of the algorithm for directed acyclic graphs.  ...  The authors would like to thank the referees for their constructive comments, which improved the exposition of the paper.  ... 
doi:10.3906/elk-1306-8 fatcat:c5etaztvdjcdlmkucf4qxikdoq
« Previous Showing results 1 — 15 out of 111,710 results