Link-failure detection in network synchronization processes

Dhal, Rahul; Torres, Jackeline Abad; Roy, Sandip

doi:10.1109/globalsip.2013.6737007

Cited by 8 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The research presented here connects to an ongoing effort on fault detection in dynamical networks in the controls engineering community [16,17]. This work is particularly closely connected to our recent study of link-failure-detection in linear synchronization processes [17], which is part of a broader effort to infer states and topological properties of dynamical networks [18,19].…”

Section: Introductionmentioning

confidence: 66%

“…This work is particularly closely connected to our recent study of link-failure-detection in linear synchronization processes [17], which is part of a broader effort to infer states and topological properties of dynamical networks [18,19]. These control-theoretic studies are focused on understanding the implications of the network's graph on detection/estimation, in the context of very simple models.…”

Section: Introductionmentioning

confidence: 87%

“…This study enhances the fault-detection methodology toward using practical models for the electric power grid, and considers real-time implementation. In this first effort, graphical results analogous to those in [17] are not obtained, but we expect the algebraic characterization given here to be a stepping stone toward structural results.…”

Section: Introductionmentioning

confidence: 94%

“…However, it is similar to the link-failure-detection analysis given in [17]; the reader is referred to this work for the analysis approach.…”

Section: B Map Detectormentioning

confidence: 99%

See 3 more Smart Citations

Fast fault location in power transmission networks using transient signatures from sparsely-placed synchrophasors

Valdez

Zhang

Torres

et al. 2014

2014 North American Power Symposium (NAPS)

Self Cite

View full text Add to dashboard Cite

This paper explores real-time fault location in a power transmission network using measurements of transients from sparsely-placed synchrophasors. The fault-location problem is abstracted to a statistical hypothesis-testing or detection problem, wherein the linearized dynamical models corresponding to different fault conditions must be distinguished in the face of fault-clearing and measurement uncertainty. A maximum a posteriori probability (MAP) detector is constructed. A strategy for real-time implementation of the fault-locator is discussed, which is based on pre-computation of detector parameters using state-estimator and contingency-analysis data, along with on-line collection of synchrophrasor data and implementation of the hypothesis test. Numerical case studies of the 11-Bus two area power system verify that the proposed faultlocation algorithm can locate a faulted line accurately and quickly.

show abstract

Section: Introductionmentioning

confidence: 66%

Section: Introductionmentioning

confidence: 87%

Section: Introductionmentioning

confidence: 94%

“…However, it is similar to the link-failure-detection analysis given in [17]; the reader is referred to this work for the analysis approach.…”

Section: B Map Detectormentioning

confidence: 99%

See 2 more Smart Citations

Fast fault location in power transmission networks using transient signatures from sparsely-placed synchrophasors

Valdez

Zhang

Torres

et al. 2014

2014 North American Power Symposium (NAPS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Relationships between the transfer function of an unweighted graph and its structural properties (such as the number of the spanning trees) have been presented in [17]. Another interesting result is presented in [18], where the objective is to detect the loss of an edge in a graph using statistical estimation methods such as maximum a posteriori estimation. In contrast to these results, in this paper we present a sufficient condition on identifiability of weighted graphs from a completely geometric point of view.…”

Section: Introductionmentioning

confidence: 99%

A global identifiability condition for consensus networks on tree graphs

Nabavi

Chakrabortty

Khargonekar

2015

2015 American Control Conference (ACC)

View full text Add to dashboard Cite

Abstract-In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph G of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical definitions of identifiability and indistinguishability, we first derive a condition that ensure the identifiability of the edge weights of G in terms of the associated transfer function. Using this characterization, we propose a sensor placement algorithm that guarantees identifiability of the edge weights. We describe our results using several illustrative examples.

show abstract

Detecting link failures in complex network processes using remote monitoring

Dhal¹,

Torres

Roy

2015

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

h i g h l i g h t s• We study detection of network changes from remote noisy time-series measurements.• A Maximum A-Posteriori Probability hypothesis testing scheme is employed.• Relationships between the network topology and MAP detector performance are developed. • Detector performance depends on presence of certain paths in the network. • Simulations demonstrate the analytical results developed. a b s t r a c tWe study whether local structural changes in a complex network can be distinguished from passive remote time-course measurements of the network's dynamics. Specifically the detection of link failures in a network synchronization process from noisy measurements at a single network component is considered. By phrasing the detection task as a Maximum A Posteriori Probability hypothesis testing problem, we are able to obtain conditions under which the detection is (1) improved over the a priori and (2) asymptotically perfect, in terms of the network spectrum and graph. We find that, in the case where the detector has knowledge of the network's state, perfect detection is possible under general connectivity conditions regardless of the measurement location. When the detector does not have state knowledge, a remote signature permits improved but not perfect detection, under the same connectivity conditions. At its essence, detectability is achieved because of the close connection between a network's topology, its eigenvalues and local response characteristics.

show abstract

Link-failure detection in network synchronization processes

Cited by 8 publications

References 3 publications

Fast fault location in power transmission networks using transient signatures from sparsely-placed synchrophasors

Fast fault location in power transmission networks using transient signatures from sparsely-placed synchrophasors

A global identifiability condition for consensus networks on tree graphs

Detecting link failures in complex network processes using remote monitoring

Contact Info

Product

Resources

About