Fastest Distributed Consensus Problem on Branches of an Arbitrary Connected Sensor Network

Details Fastest Distributed Consensus Problem on Branches of an Arbitrary Connected Sensor Network Fastest Distributed Consensus Problem on Branches of an Arbitrary Connected Sensor Network

2010-04-28

arxiv.org/abs/1004.5094v2

Computer Science

Information Theory

11 pages, 13 figures, 1 table

Scientific paper

This paper studies the fastest distributed consensus averaging problem on branches of an arbitrary connected sensor network. In the previous works full knowledge about the sensor network's connectivity topology was required for determining the optimal weights and convergence rate of distributed consensus averaging algorithm over the network. Here in this work for the first time, the optimal weights are determined analytically for the edges of certain types of branches, independent of the rest of network. The solution procedure consists of stratification of associated connectivity graph of the branches and Semidefinite Programming (SDP), particularly solving the slackness conditions, where the optimal weights are obtained by inductive comparing of the characteristic polynomials initiated by slackness conditions. Several examples and numerical results are provided to confirm the optimality of the obtained weights.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-69309