Given a network of interconnected nodes, each with its own value (such as measurement, position, vote, or other data), we develop distributed strategy that enables some all the nodes to calculate any arbitrary function node values, despite actions malicious in network. Our scheme assumes broadcast model communication (where transmit same their neighbors) and utilizes linear iteration where, at time-step, updates be weighted average previous those neighbors. We consider faulty if, instead...

In this paper, we propose an architecture for voltage regulation in distribution networks that relies on controlling reactive power injections provided by distributed energy resources (DERs). A local controller each bus of the network monitors and, whenever there is a violation, it uses locally available information to estimate amount needs be injected into order correct violation. If DERs connected can collectively provide estimated controller, they are instructed do so. Otherwise,...

In this paper, we follow a state-based approach to extend the notion of opacity in computer security discrete event systems. A system is (S, P)-opaque if evolution its true state through set secret states S remains opaque an observer who observing activity projection map P. other words, based on observations mapping P, never certain that current within S. We also introduce stronger (S,P, K)-opacity which requires remain for K following departure system's from show definition enables use...

We present a method for achieving consensus in distributed systems finite number of time-steps. Our scheme involves linear iteration where, at each time-step, node updates its value to be weighted average own previous and those neighbors. If D denotes the degree minimal polynomial weight matrix associated with iteration, we show that can immediately calculate as combination past values over most also determine coefficients this decentralized manner. The proposed has potential significantly...

In this paper, we develop and analyze a distributed privacy-preserving average consensus algorithm that enables all of the components system, each with some initial value, to asymptotically reach on their values, without having reveal specific value they contribute calculation. We consider set (nodes) interact via directional communication links (edges) form generally directed topology (digraph). The proposed protocol can be followed by node does not want its and, under certain conditions...

In this paper, we address the problem of optimally dispatching a set distributed energy resources (DERs) without relying on centralized decision maker. We consider scenario where each DER can provide certain resource (e.g., active or reactive power) at some cost (namely, quadratic in amount resource), with additional constraint that provides is upper and lower bounded by its capacity limits. propose low-complexity iterative algorithm for optimal dispatch relies, iteration, simple...

This paper presents a method to identify and localize failures in smart grids. The is based on carefully designed Petri net (PN) that captures the modeling details of protection system distribution network allows detection/identification data transmission faults by means simple matrix operations. design PN model carried out composing multiple models for single systems: Such an approach identification despite possible strong penetration distributed generation. In order verify method, two case...

Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables subset the nodes to calculate any given function node values. Our scheme utilizes linear iteration where, at each time-step, updates its value be weighted average own previous those neighbors. We show this approach can viewed as dynamical system, with dynamics are by weight matrix iteration, outputs for captured set values available time-step. In connected networks time-invariant...

Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components a given multi-component system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions links. In this work, we propose protocol overcomes limitation and, unlike existing protocols the presence delays, ensures exact average, despite arbitrary...

We present a method for constructing reduced-order state observers linear systems with unknown inputs. Our approach provides characterization of delay, which eases the established necessary conditions existence input zero-delay. develop parameterization observer gain that decouples inputs from estimation error, and we use remaining freedom to ensure stability error dynamics. procedure is quite general in it encompasses design full-order via appropriate choices matrices

This paper discusses the utilization of distributed energy resources on distribution side power grid to provide a number ancillary services. While individual capability these support might be very small, their presence in large numbers many networks implies that, under proper control, they can collectively become an asset for providing An example is electronics interface photovoltaic array mounted residential building roof. its primary function control active flow, when properly controlled,...

We describe and analyze the complexity of verifying notion infinite-step opacity in systems that are modeled as non-deterministic finite automata with partial observation on their transitions. Specifically, a system is opaque if entrance state, at any particular instant, to set secret states remains (uncertain), for length operation, an intruder who observes activity through some projection map. Infinite-step can be used characterize security requirements many applications, including...

Motivated by security and privacy considerations in a variety of applications discrete event systems, we describe analyze the computational complexity required for verifying notion <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -step opacity systems that are modeled as nondeterministic finite automata with partial observation on their transitions. Specifically, system is opaque if, at any specific point within last observations, entrance...

In this paper, we propose a distributed architecture for generation control in islanded ac microgrids with both synchronous generators and inverter-interfaced power supplies. Although they are smaller have lower ratings, the objectives an microgrid similar to those large systems, e.g., bulk transmission networks; specifically, without violating limits on generator output, frequency must be regulated costs should minimized. However, implementation of functions is centralized, i.e., there...

State-based notions of opacity, such as initial-state opacity and infinite-step emerge key properties in numerous security applications discrete event systems. We consider systems that are modeled partially observed nondeterministic finite automata tackle the problem constructing a minimally restrictive opacity-enforcing supervisor (MOES), which limits system's behavior within some prespecified legal while enforcing or requirements. characterize solution to MOES, under mild assumptions,...

A system is said to be current-state opaque if the entrance of state a set secret states remains (uncertain) an intruder-at least until leaves states. This notion opacity has been studied in nondeterministic finite automata settings (where intruder observes subset events, for example, via some natural projection mapping) and shown useful characterizing security requirements many applications (including encryption using pseudorandom generators coverage properties sensor networks). One...

Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a protocol that allows nodes to find the exact average of initial values in finite and minimum number steps on interconnection topologies described by strongly connected directed graphs (digraphs). More specifically, under assumption each component has knowledge its outgoing links (i.e., components which it sends information), we show value can be computed based local observations over time...

In this article, we develop distributed iterative algorithms that enable the components of a multicomponent system, each with some integer initial value, to asymptotically compute average their values, without having reveal other specific value they contribute calculation. We assume communication topology captured by an arbitrary strongly connected digraph, in which certain nodes (components) might be curious but not malicious (i.e., execute protocol correctly, try identify values nodes)....

The increasing availability of network connectivity has prompted the study computer-based control methodologies that are implemented centrally or distributively using existing infrastructure as communications backbone. Recent work looked at stability networked systems (i.e., in which feedback loops closed through networks) and focused on performance guarantees under networked. induced delays varying data packet rates. In this work, we extend these ideas a probabilistic setting by modeling...

This paper proposes distributed algorithms for control and coordination of loads energy resources (DERs) in distribution networks. These are relevant load curtailment demand response programs, also DERs provision ancillary services. Both the load-curtailment DER problems can be cast as resource allocation with constraints on capacity. We focus linear iterative which each j maintains a set values that is updated to weighted combination resource's own previous sets its neighboring resources....

We develop a graph-theoretic characterization of controllability and observability linear systems over finite fields. Specifically, we show that system will be structurally controllable observable field if the graph satisfies certain properties, size is sufficiently large. also provide upper bounds on indices for structured (over arbitrary fields). then use our analysis to design nearest-neighbor rules multi-agent where state each agent constrained lie in set. view discrete states as...

This paper considers networked systems and develops distributed algorithm that is resilient against potential packet drops in the communication links between system components. We apply this to problem of coordinating energy resources (DERs) for provision ancillary services electrical networks, e.g., reactive power support voltage control. In problem, each component can contribute a certain amount active and/or power, bounded from above (possibly) below by capacity constraints, objective...