The Power Domination Toolbox

arXiv2305.13446MaRDI QIDQ6437556FDOQ6437556

Publication date: 22 May 2023

Abstract: Phasor Measurement Units (PMUs) are placed at strategic nodes in an electrical power network to directly monitor nearby transmission lines and monitor further parts of the network through conservation of energy laws.Efficient placement of PMUs is modeled by the graph theoretic process called Power Domination (PD). This paper describes a Power Domination Toolbox (PDT) that efficiently identifies potential PMU locations. The PDT leverages the graph theoretic literature to reduce the complexity of determining optimal PMU placements by: reducing the size of the network (contraction), identification of preferred nodes, elimination of redundant nodes, assignment of a qualitative score to the remaining nodes, and parallel processing techniques. After pre-processing steps to reduce network size, current state-of-the-art PD techniques based on the minimum rank sage library (MRZG) are used to analyze the network. The PDT is an extension of MRZG in Python and maintains the compatibility of MRZG with SageMath. The PDT can identify minimum PMU placements for networks with hundreds of nodes on personal computers and can analyze larger networks on high performance computers. The PDT affords users the ability to investigate power domination on networks previously considered infeasible due to the number of nodes resulting in a prohibitively long run-time.

Has companion code repository: https://github.com/jibjibflutterhousen/powerdominationtoolbox

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: The Power Domination Toolbox

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437556)