Fastest Distributed Consensus on Path Network

Details Fastest Distributed Consensus on Path Network Fastest Distributed Consensus on Path Network

2010-02-03

arxiv.org/abs/1002.0722v2

Computer Science

Information Theory

4 pages, 1 figure

Scientific paper

Providing an analytical solution for the problem of finding Fastest Distributed Consensus (FDC) is one of the challenging problems in the field of sensor networks. Most of the methods proposed so far deal with the FDC averaging algorithm problem by numerical convex optimization methods and in general no closed-form solution for finding FDC has been offered up to now except in [3] where the conjectured answer for path has been proved. Here in this work we present an analytical solution for the problem of Fastest Distributed Consensus for the Path network using semidefinite programming particularly solving the slackness conditions, where the optimal weights are obtained by inductive comparing of the characteristic polynomials initiated by slackness conditions.

Affiliated with

Also associated with

No associations

Rating

Fastest Distributed Consensus on Path Network 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 Fastest Distributed Consensus on Path Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fastest Distributed Consensus on Path Network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602069