TY - GEN
T1 - Delay Constrained Communication Network Design for PMU to Multiple Control Center Data Transfer
AU - Sen, A.
AU - Byeon, G.
AU - Roy, S.
AU - Basu, K.
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In a smart grid environment, communication network plays an important role as it must deliver data from the Phasor Measurement Units (PMUs) in the Substations (SSs) to the Control Center(s) (CCs) in real time. Accordingly, communication network design has received considerable attention from smart grid researchers in the last few years. In a recent paper, we studied this problem where all the substations were sending data to a single CC and formalized it as the Rooted Delay Constrained Minimum Spanning Tree problem. As the number of substations in a geographic area is often large, PMU data from the substations do not directly go to the Control Center (CC) and instead goes to multiple Local Controls Centers (LCC) within a specified delay threshold. The aggregated data from the LCCs is then sent to the CC. In this paper, we extend our earlier results by considering Multiple Local Control Centers (MLCCs) where the PMU data must arrive from the SSs to a LCC within a specified delay threshold. This gives rise to a new problem, where we need to create a Delay Constrained Spanning Forest instead of a Delay Constrained Spanning Tree as in earlier studies. We provide (i) an optimal solution for the problem using Integer Linear Programming, (ii) a Lagrangian Relaxation, and (iii) a Heuristic solution. Finally, we evaluate the performance of our solution techniques with real substation location data of Arizona.
AB - In a smart grid environment, communication network plays an important role as it must deliver data from the Phasor Measurement Units (PMUs) in the Substations (SSs) to the Control Center(s) (CCs) in real time. Accordingly, communication network design has received considerable attention from smart grid researchers in the last few years. In a recent paper, we studied this problem where all the substations were sending data to a single CC and formalized it as the Rooted Delay Constrained Minimum Spanning Tree problem. As the number of substations in a geographic area is often large, PMU data from the substations do not directly go to the Control Center (CC) and instead goes to multiple Local Controls Centers (LCC) within a specified delay threshold. The aggregated data from the LCCs is then sent to the CC. In this paper, we extend our earlier results by considering Multiple Local Control Centers (MLCCs) where the PMU data must arrive from the SSs to a LCC within a specified delay threshold. This gives rise to a new problem, where we need to create a Delay Constrained Spanning Forest instead of a Delay Constrained Spanning Tree as in earlier studies. We provide (i) an optimal solution for the problem using Integer Linear Programming, (ii) a Lagrangian Relaxation, and (iii) a Heuristic solution. Finally, we evaluate the performance of our solution techniques with real substation location data of Arizona.
UR - http://www.scopus.com/inward/record.url?scp=85178254004&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85178254004&partnerID=8YFLogxK
U2 - 10.1109/ICC45041.2023.10279430
DO - 10.1109/ICC45041.2023.10279430
M3 - Conference contribution
AN - SCOPUS:85178254004
T3 - IEEE International Conference on Communications
SP - 4100
EP - 4105
BT - ICC 2023 - IEEE International Conference on Communications
A2 - Zorzi, Michele
A2 - Tao, Meixia
A2 - Saad, Walid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE International Conference on Communications, ICC 2023
Y2 - 28 May 2023 through 1 June 2023
ER -