k-Nearest neighbour based approach for the protection of distribution network with renewable energy integration

•The maximum fault detection time is found to be less than half-cycle, which helps in faster maintenance and classification accuracy is 100%.•The algorithm proposed for fault location is based on k-Nearest neighbor regression method. The achieved accuracy of fault location is found to be better than the methods proposed in the literature.•Numerous case studies have been done to check the robustness of the algorithm. This paper presents a novel protection algorithm based on K-medoids clustering and weighted k-Nearest neighbor regression. K-medoids clustering is used for fault detection and classification, while weighted k-Nearest neighbor regression is used to locate the fault. The three phase current signals are sampled at substation with frequency of 3.84 kHz and then decomposed with a db1 mother wavelet. Using the moving window of one cycle, k-medoids clustering is applied to wavelet approximate coefficients over a cycle to obtain two medoids. The difference of medoids is defined as fault index, which is compared with threshold to detect and classify the faults. Various statistical features are computed from post fault approximate wavelet coefficients obtained are fed to k-Nearest Neighbor classifier detect the two nearest buses. Followed by this detection the fault location between these two busses is estimated using weighted k-NN regression. The process of detection, classification and location of fault is accomplished within half a cycle. The various case studies used for established the robustness of the algorithm include type of fault, fault impedance and fault incidence angle and fault location. The proposed algorithm is proved to be not affected by DG trip, islanding and noise.