Optimal μPMU, PDC, and Communication Link Placement in Distribution Network Using Binary Carnivorous Plant Algorithm

IEEE Transactions on Industry Applications(2023)

引用 0|浏览0
暂无评分
摘要
Observability ensured for one distribution topology by a set of μPMUs may overlooks state variables for another one. This paper proposes optimal micro-Phasor Measurement Unit (μPMU) placement in distribution networks, satisfying complete system observability to all possible spanning trees of a radial network, attained by Kirchhoff's matrix tree theorem. Since communication infrastructure is imperative to secure the data transfer from μPMU to Phasor Data Concentrator (PDC), a holistic PDC-communication link placement strategy is indispensable. A convenient procedure for simultaneous PDC and communication link placement is proposed in this paper. This aims at minimizing communication costs and escalating the maximum channel throughput for an optimal number of μPMUs. Costs of PDCs, communication channels, and bandwidth for μPMU to PDC & PDC to PDC are incorporated to attain minimum communication cost. To enhance the maximum channel throughput, minimization of maximum channel load is consolidated within the cost-effective, objective framework. Binary Carnivorous Plant Algorithm (BCPA) is utilized first to get the optimal number of μPMUs. Later, PDC and Communication links are placed optimally. The simulation is carried out for IEEE 33, 34 & 69 test bus systems. The proposed method requires 5.88% lesser μPMUs considering topology changes for IEEE 33 bus system compared to existing literature. The savings in communication cost, and maximum channel load are 35.18% and 21.43%, respectively, for the same system. Whereas, for IEEE 69 bus system, the savings in communication cost, and maximum channel load are 17.65% and 47.06%, respectively.
更多
查看译文
关键词
distribution network,communication link placement,optimal μpmu
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要