z-logo
open-access-imgOpen Access
A New Distribution Network Structure for Maximizing the Allowable Penetration of Distributed Energy Resource
Author(s) -
Shanshan Zhao,
Xiaohui Song,
Y J Li,
Fei Gao,
Y Zhang,
Jianlong Li,
Zheng Yuan Jia
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/486/1/012064
Subject(s) - penetration (warfare) , computer science , distributed generation , distributed computing , network structure , resource distribution , network security , complex network , reliability engineering , engineering , operations research , computer network , renewable energy , resource allocation , electrical engineering , world wide web
The traditional network structure cannot be suitable for the connection of large-scale distributed energy resources, thus the high penetration of distributed energy resource (DER) will have destructive effects on the security and reliability of the traditional distribution network. The paper proposes a new distribution network structure to increase the maximum allowable penetration of DER. Firstly, the model and method of the new distribution network structure are presented. Secondly, the theory basis of increasing the DER penetration by the new network structure is proved. Finally, the proposed model and method are applied to the typical test case. And the simulation results show that compared with the traditional structure, the new distribution network structure can not only increase the maximum penetration of distributed energy resource greatly, but also realize the high energy efficiency, reliability and sustainability. Therefore, the issue of future distribution network security with high penetration of distributed energy resource can be well solved by the new distribution network structure proposed in the paper.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here