Computer Science – Information Theory
Scientific paper
2008-02-27
Computer Science
Information Theory
submitted to IEEE Transactions on Signal Processing
Scientific paper
10.1109/TSP.2008.2006147
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. Most methods proposed in the literature address the consensus averaging problem by distributed linear iterative algorithms, with asymptotic convergence of the consensus solution. The convergence rate of such distributed algorithms typically depends on the network topology and the weights given to the edges between neighboring sensors, as described by the network matrix. In this paper, we propose to accelerate the convergence rate for given network matrices by the use of polynomial filtering algorithms. 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. Such an algorithm is equivalent to periodic updates in each of the sensors by aggregating a few of its previous estimates. We formulate the computation of the coefficients of the optimal polynomial as a semi-definite program that can be efficiently and globally solved for both static and dynamic network topologies. We finally provide simulation results that demonstrate the effectiveness of the proposed solutions in accelerating the convergence of distributed consensus averaging problems.
Frossard Pascal
Kokiopoulou Effrosyni
No associations
LandOfFree
Polynomial Filtering for Fast Convergence in Distributed Consensus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Polynomial Filtering for Fast Convergence in Distributed Consensus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial Filtering for Fast Convergence in Distributed Consensus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-25731