Fastest Distributed Consensus on Path Network
نویسنده
چکیده
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.
منابع مشابه
Fastest Distributed Consensus Averaging Problem on Chain of Rhombus Networks
Distributed consensus has appeared as one of the most important and primary problems in the context of distributed computation and it has received renewed interest in the field of sensor networks (due to recent advances in wireless communications), where solving fastest distributed consensus averaging problem over networks with different topologies is one of the primary problems in this issue. ...
متن کاملBelief consensus algorithms for fast distributed target tracking in wireless sensor networks
In distributed target tracking for wireless sensor networks, agreement on the target state can be achieved by the construction and maintenance of a communication path, in order to exchange information regarding local likelihood functions. Such an approach lacks robustness to failures and is not easily applicable to ad-hoc networks. To address this, several methods have been proposed that allow ...
متن کاملFastest Distributed Consensus Averaging Problem on Perfect and Complete n-ary Tree networks
Solving fastest distributed consensus averaging problem (i.e., finding weights on the edges to minimize the second-largest eigenvalue modulus of the weight matrix) over networks with different topologies is one of the primary areas of research in the field of sensor networks and one of the well known networks in this issue is tree network. Here in this work we present analytical solution for th...
متن کاملFastest Distributed Consensus Problem on Fusion of Two Star Networks
Finding optimal weights for the problem of Fastest Distributed Consensus on networks with different topologies has been an active area of research for a number of years. Here in this work we present an analytical solution for the problem of Fastest Distributed Consensus for a network formed from fusion of two different symmetric star networks or in other words a network consists of two differen...
متن کاملFastest Distributed Consensus Problem on Branches of an Arbitrary Connected Sensor Network
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 wei...
متن کامل