期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 58, 期 7, 页码 3788-3801出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2010.2046635
关键词
Broadcast gossip; consensus; correlated link failures; sensor networks; switching topology; unconstrained optimization; weight optimization
资金
- NSF [CNS-0428404]
- Office of Naval Research [MURI N000140710747]
- Fundacao de Ciencia e Tecnologia (FCT) from Portugal [SIPM PTDC/EEA-ACR/73749/2006, SFRH/BD/33520/2008]
- ISR/IST
- Fundação para a Ciência e a Tecnologia [SFRH/BD/33520/2008] Funding Source: FCT
We design the weights in consensus algorithms for spatially correlated random topologies. These arise with 1) networks with spatially correlated random link failures and 2) networks with randomized averaging protocols. We show that the weight optimization problem is convex for both symmetric and asymmetric random graphs. With symmetric random networks, we choose the consensus mean-square error (MSE) convergence rate as the optimization criterion and explicitly express this rate as a function of the link formation probabilities, the link formation spatial correlations, and the consensus weights. We prove that the MSE convergence rate is a convex, nonsmooth function of the weights, enabling global optimization of the weights for arbitrary link formation probabilities and link correlation structures. We extend our results to the case of asymmetric random links. We adopt as optimization criterion the mean-square deviation (MSdev) of the nodes' states from the current average state. We prove that MSdev is a convex function of the weights. Simulations show that significant performance gain is achieved with our weight design method when compared with other methods available in the literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据