A Distributed Algorithm For Fault Isolation Of Distribution Network

As the need of people for reliability and quality of the power supply is higher, more demands for the speed and veracity of fault isolation of distribution network are mentioned. By now, the distribution automation system mainly uses a kind of control based on the centralized communication. A master station collects all the information from FTUs, analyses the location of fault with the information of the whole network, and then sends orders to the right FTU to isolate the fault. However, the implement of this method is deeply depended on the sub-master station. And it has a poor adaptability of information distortion, which means that if some information is distorted or missing, the whole algorithm will fail. The use of distributed algorithm in fault isolation can successfully isolate the fault by analyzing the information from its neighbors and itself. It gives a good solution to the problem that caused by the loss and distortion of the information. This way is rapidity, accuracy and autonomy. And it will be the future direction of the fault isolation.A distributed algorithm based on group for fault isolate of distribution network is brought forward in this paper. The method of this algorithm: partition the distributed network and choose a group leader for each group. The leader of the group members could achieve the fault isolation according to the information that all the members in this group collects. This scheme does not depend on the sub-master station, which improves the speed of processing failure of distributed network. The algorithm is analyzed, when the information that station collects is completed, and also when some of the information is missing. The validity of the algorithm is proved by using it for a radial distributed network.Then, the time series features of this distributed algorithm are also analyzed. The cooperation between the distributed fault isolation algorithm and the solution of fault isolation using now is discussed in this paper. And the time series between them are given and explained by using a typical distribution network as an example.Finally, a brief description of DNP 3.0 is given. And the composition of the structure, the frame format in each layer and the characteristics of the protocol are discussed. In the end, how to use the DNP 3.0 protocol for the distributed algorithm that mentioned before is showed to us.