Optimal PMU placement problem in octahedral networks

¹ Department of Mathematics, Rajalakshmi Engineering College, Chennai 602105, India
² Department of Mathematics, Easwari Engineering College, Chennai 600089, India
³ Clean and Resilient Energy Systems Laboratory, Texas A&M University, Galveston, TX 77553, USA
⁴ Oregon Renewable Energy Center, Department of Electrical Engineering and Renewable Energy, Oregon Institute of Technology, Klamath Falls, OR 97601, USA

^* Corresponding author: drsavariprabhu@gmail.com

Received: 24 October 2021
Accepted: 30 August 2022

Abstract

Power utilities must track their power networks to respond to changing demand and availability conditions to ensure effective and efficient operation. As a result, several power companies employ phase measuring units (PMUs) to check their power networks continuously. Supervising an electric power system with the fewest possible measurement equipment is precisely the vertex covering graph-theoretic problem, in which a set D is defined as a power dominating set (PDS) of a graph if it supervises every components (vertices and edges) in the system (with a couple of rules). The γ_p(G) is the minimal cardinality of a PDS of a graph G. In this present study, the PDS is identified for octahedral networks.