File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimum degree reordering based graph partitioning method for distributed fault section estimation system in power networks

TitleMinimum degree reordering based graph partitioning method for distributed fault section estimation system in power networks
Authors
KeywordsFault section estimation
Graph partitioning
Large-scale power networks
Issue Date2001
PublisherIEEE.
Citation
IEEE/PES Transmission and Distribution Conference and Exposition, Atlanta, Georgia, USA, 28 October - 2 November 2001, v. 1, p. 212-216 How to Cite?
AbstractIn order to make fault section estimation (FSE) in large-scale power networks use distributed artificial intelligence approach, we have to develop an efficient way to partition the large-scale power network into desired number of connected sub-networks such that each sub-network should have quasi-balanced working burden in performing FSE. In this paper, an efficient minimum degree reordering based graph partitioning method is suggested for the partitioning task. The method consists of two basic steps: partitioning the power network into connected, quasi-balanced and frontier minimized sub-networks based on minimum degree reordering and minimizing the number of the frontier nodes of the sub-networks through iterations so as to reduce the interaction of FSE in adjacent sub-networks. The partitioning procedure and characteristic analysis is presented. The method has been implemented with sparse storage technique and tested in the IEEE 14-bus, 30-bus and 118-bus systems respectively. Computer simulation results show that the proposed multiple-way graph partitioning method is suitable for FSE in large-scale power networks and is compared favorably with other graph partitioning methods suggested in references.
Persistent Identifierhttp://hdl.handle.net/10722/46344
References

 

DC FieldValueLanguage
dc.contributor.authorBi, Ten_HK
dc.contributor.authorNi, Yen_HK
dc.contributor.authorWu, FFen_HK
dc.contributor.authorYang, Qen_HK
dc.date.accessioned2007-10-30T06:47:49Z-
dc.date.available2007-10-30T06:47:49Z-
dc.date.issued2001en_HK
dc.identifier.citationIEEE/PES Transmission and Distribution Conference and Exposition, Atlanta, Georgia, USA, 28 October - 2 November 2001, v. 1, p. 212-216en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46344-
dc.description.abstractIn order to make fault section estimation (FSE) in large-scale power networks use distributed artificial intelligence approach, we have to develop an efficient way to partition the large-scale power network into desired number of connected sub-networks such that each sub-network should have quasi-balanced working burden in performing FSE. In this paper, an efficient minimum degree reordering based graph partitioning method is suggested for the partitioning task. The method consists of two basic steps: partitioning the power network into connected, quasi-balanced and frontier minimized sub-networks based on minimum degree reordering and minimizing the number of the frontier nodes of the sub-networks through iterations so as to reduce the interaction of FSE in adjacent sub-networks. The partitioning procedure and characteristic analysis is presented. The method has been implemented with sparse storage technique and tested in the IEEE 14-bus, 30-bus and 118-bus systems respectively. Computer simulation results show that the proposed multiple-way graph partitioning method is suitable for FSE in large-scale power networks and is compared favorably with other graph partitioning methods suggested in references.en_HK
dc.format.extent613035 bytes-
dc.format.extent12538 bytes-
dc.format.extent11910 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings of the IEEE Power Engineering Society Transmission and Distribution Conferenceen_HK
dc.rights©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectFault section estimationen_HK
dc.subjectGraph partitioningen_HK
dc.subjectLarge-scale power networksen_HK
dc.titleMinimum degree reordering based graph partitioning method for distributed fault section estimation system in power networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailNi, Y: yxni@eee.hku.hken_HK
dc.identifier.emailWu, FF: ffwu@eee.hku.hken_HK
dc.identifier.authorityNi, Y=rp00161en_HK
dc.identifier.authorityWu, FF=rp00194en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TDC.2001.971236en_HK
dc.identifier.scopuseid_2-s2.0-0035680255en_HK
dc.identifier.hkuros73367-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035680255&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume1en_HK
dc.identifier.spage212en_HK
dc.identifier.epage216en_HK
dc.identifier.scopusauthoridBi, T=6602683764en_HK
dc.identifier.scopusauthoridNi, Y=7402910021en_HK
dc.identifier.scopusauthoridWu, FF=7403465107en_HK
dc.identifier.scopusauthoridYang, Q=7404075866en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats