In this paper, the performance limits of faults localization are investigated using synchrophasor data. The focus is on a non-trivial operating regime where the number of Phasor Measurement Unit (PMU) sensors available is insufficient to have full observability of the grid state. Proposed analysis uses the Kullback Leibler (KL) divergence between the distributions corresponding to different fault location hypotheses associated with the observation model. This analysis shows that the most likely locations are concentrated in clusters of buses more tightly connected to the actual fault site akin to graph communities. Consequently, a PMU placement strategy is derived that achieves a near-optimal resolution for localizing faults for a given number of sensors. The problem is also analyzed from the perspective of sampling a graph signal, and how the placement of the PMUs i.e. the spatial sampling pattern and the topological characteristic of the grid affect the ability to successfully localize faults. To highlight the superior performance of presented fault localization and placement algorithms, the proposed strategy is applied to a modified IEEE 34, IEEE-123 bus test cases and to data from a real distribution grid. Additionally, the detection of cyber-physical attacks is also examined where PMU data and relevant Supervisory Control and Data Acquisition (SCADA) network traffic information are compared to determine if a network breach has affected the integrity of the system information and/or operations.

We describe the fully automated workflow path developed for the ingest and analysis of liquid chromatography mass spectrometry (LCMS) data. With the help of this computational workflow, we were able to replace two human work days to analyze data with two hours of unsupervised computation time. In addition, this tool also can compute confidence intervals for all its results, based on the noise level present in the data. We leverage only open source tools and libraries in this workflow.

In this paper, we showcase a complete, end-to-end, fault tolerant, bandwidth and latency optimized architecture for real time utilization of data from multiple sources that allows the collection, transport, storage, processing, and display of both raw data and analytics. This architecture can be applied for a wide variety of applications ranging from automation/control to monitoring and security. We propose a practical, hierarchical design that allows easy addition and reconfiguration of software and hardware components, while utilizing local processing of data at sensor or field site ("fog computing") level to reduce latency and upstream bandwidth requirements. The system supports multiple fail-safe mechanisms to guarantee the delivery of sensor data. We describe the application of this architecture to cyber-physical security (CPS) by supporting security monitoring of an electric distribution grid, through the collection and analysis of distribution-grid level phasor measurement unit (PMU) data, as well as Supervisory Control And Data Acquisition (SCADA) communication in the control area network.

This paper provides new insights on the convergence of a locally connected network of pulse coupled oscillator (PCOs) (i.e., a bioinspired model for communication networks) to synchronous and desynchronous states, and their implication in terms of the decentralized synchronization and scheduling in communication networks. Bioinspired techniques have been advocated by many as fault-tolerant and scalable alternatives to produce self-organization in communication networks. The PCO dynamics, in particular, have been the source of inspiration for many network synchronization and scheduling protocols. However, their convergence properties, especially in locally connected networks, have not been fully understood, prohibiting the migration into mainstream standards. This paper provides further results on the convergence of PCOs in locally connected networks and the achievable convergence accuracy under propagation delays. For synchronization, almost sure convergence is proved for three nodes and accuracy results are obtained for general locally connected networks, whereas for scheduling (or desynchronization), results are derived for locally connected networks with mild conditions on the overlapping set of maximal cliques. These issues have not been fully addressed before in the literature.

The pulse-coupled synchronization and scheduling (PulseSS) protocol is proposed in this paper for simultaneous synchronization and scheduling of communication activities in clustered wireless sensor networks (WSNs), by emulating the emergent behavior of pulse-coupled oscillator (PCO) networks in mathematical biology. Different from existing works that address synchronization and scheduling (i.e., desynchronization) separately, PulseSS provides a coordination signaling mechanism that achieves decentralized network synchronization and time division multiple access scheduling simultaneously at different time scales for clustered WSNs. Here, we assume that the nodes are connected only locally via their respective cluster heads. Moreover, PulseSS addresses the issue of propagation delays, that may plague the accuracy of PCO synchronization in practice, by providing ways to estimate and precompensate for these values locally at the sensors (i.e., PCOs). At the same time the protocol retains the adaptivity and light-weight nature of PCO protocols both in terms of signaling and computations. Simulations of both physical and medium access control layers show a synchronization accuracy of factions of microseconds above 15 dB of signal to interference and noise ratio for a five cluster network. A hardware implementation of PulseSS using TinyOS is also provided to corroborate the real world applicability of our protocol.