Fault-tolerant Network Design for Bounded Delay Data Transfer from PMUs to Control Center
A. Sen, C. Sumnicht, S. Adeniye, D. Patel, S. Choudhuri

TL;DR
This paper addresses the design of fault-tolerant communication networks for power grid monitoring, ensuring data from PMUs reaches the control center within delay constraints even if some links fail.
Contribution
It introduces the RDCMCCC problem for fault-tolerant network design with delay constraints, providing complexity analysis, an ILP formulation, and a heuristic solution.
Findings
Heuristic performs well on real substation data.
Optimal solutions are computable via ILP.
Fault-tolerant design ensures data delivery despite link failures.
Abstract
Communication network design for monitoring the state of an electric power grid has received significant attention in recent years. In order to measure stability of a power grid, it is imperative that measurement data collected by the Phasor Measurement Units (PMUs) located at the Sub-Stations (SS) must arrive at the Control Center (CC) within a specified delay threshold delta. In earlier papers we formalized the design problem as the Rooted Delay Constrained Minimum Spanning Tree (RDCMST) problem. However, RDCMST does not provide any fault-tolerance capability, as failure of just one communication link would prevent PMU data from reaching the CC. In this paper, we study the optimal cost network design problem with fault tolerance capability. In our model the PMU data from the SSs will have a path to reach the CC in spite of the failure of at most R links within the delay threshold…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Opportunistic and Delay-Tolerant Networks · Energy Efficient Wireless Sensor Networks
