A High-Speed Fault Detection, Identification, and Isolation Method for a Last Mile Radial LVDC Distribution Network
Saeed Zaman Jamali, Syed Basit Ali Bukhari, Muhammad Omer Khan and 4 more
Energies · 2018
doi:10.3390/en11112901 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The day-by-day increase in digital loads draws attention towards the need for an efficient and compatible distribution network. An LVDC distribution network has the capability to fulfill such digital load demands. However, the major challenge of an LVDC distribution network is its vulnerability during a fault. The need for a high-speed fault detection method is inevitable before it can be widely adopted. This paper proposes a new fault detection method which extracts the features of the current during a fault. The proposed fault detection method uses the merits of overcurrent, the first and second derivative of current, and signal processing techniques. Three different features are extracted from a time domain current signal through a sliding window. The extracted features are based upon the root squared zero, second, and fourth order moments. The features are then set with individual thresholds to discriminate low-, high-, and very high-resistance faults. Furthermore, a fault is located through the superimposed power flow. Moreover, this study proposes a new method based on the vector sum of positive and negative pole currents to identify the faulty pole. The proposed scheme is verified by using a modified IEEE 13 node distribution network, which is implemented in Matlab/Simulink. The simulation results confirm the effectiveness of the proposed fault detection and identification method. The simulation results also confirm that a fault having a resistance of 1 m<inline-formula> <math display="inline"> <semantics> <mi mathvariant="sans-serif">Ω</mi> </semantics> </math> </inline-formula> is detected and interrupted within 250 <inline-formula> <math display="inline"> <semantics> <mi mathvariant="sans-serif">μ</mi> </semantics> </math> </inline-formula>s for the test system used in this study.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.