Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
Rabbat, M. G.
Hadjicostis, Christoforos N.
SourceIEEE Transactions on Control of Network Systems
Google Scholar check
MetadataShow full item record
Many of the algorithms that have been proposed in the field of distributed computation rely on assumptions that require nodes to be aware of some global parameters. In this paper, we propose algorithms to compute some network parameters in a distributed fashion and in a finite number of steps. More specifically, given an arbitrary strongly connected network of interconnected nodes, by adapting a distributed finite-time approach, we develop distributed strategies that enable nodes to compute the following network parameters: the left-eigenvector, the out-degree, and the spectrum of weighted adjacency matrices. © 2015 IEEE.
Showing items related by title, author, creator and subject.
Hadjicostis, Christoforos N. (2010)Enhancing the security and reliability of automated systems that control vital national infrastructures, such as energy and water distribution systems, has recently emerged as a critical aspect of maintaining, protecting, ...
Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2010)This paper discusses the utilization of distributed energy resources on the distribution side of the power grid to provide a number of ancillary services. While the individual capability of these resources to provide grid ...
Finite-time approximate consensus and its application to distributed frequency regulation in islanded AC microgrids Cady, S. T.; Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (IEEE Computer Society, 2015)In this paper, we propose an iterative algorithm that allows a set of interconnected nodes to reach approximate consensus in a finite number of steps, i.e., Allows the nodes to reach agreement to within a pre-specified ...