Browsing by Subject "Interconnected nodes"
Now showing items 1-6 of 6
-
Article
Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
(2016)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 ...
-
Conference Object
Distributed function calculation via linear iterations in the presence of malicious agents - Part II: Overcoming malicious behavior
(2008)Given a network of interconnected nodes, each with a given initial value, we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of these initial values, despite the ...
-
Conference Object
Finite-time approximate consensus and its application to distributed frequency regulation in islanded AC microgrids
(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 ...
-
Conference Object
Information dissemination in networks via linear iterative strategies over finite fields
(2009)Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only ...
-
Conference Object
Linear iterative strategies for transmitting streams of values through sensor networks
(2009)For any given fixed network of interconnected nodes, with some nodes designated as sources and some nodes designated as sinks, we investigate the problem of transmitting a stream of values from every source node to all of ...
-
Conference Object
On the time complexity of information dissemination via linear iterative strategies
(2010)Given an arbitrary network of interconnected nodes, each with an initial value, we study the number of time-steps required for some (or all) of the nodes to gather all of the initial values via a linear iterative strategy. ...