Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Computationally Efficient Topology Identifiability Analysis of Distribution Systems
Date
2022-07-01
Author
Eser, Fatih
Yılmaz, Uğur Can
Dursun, Erk
Cinalioglu, Mustafa Cihan
Göl, Murat
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
163
views
0
downloads
Cite This
© 2022 Elsevier B.V.Because of the lack of a proper real-time monitoring system at distribution power networks, topology identification can not be performed properly. While in traditional radial structures the topology is unique, in the presence of an open-ring structure, this issue constitutes a risk for the operation of the system, and the safety of the field staff in contact with the system components. Many studies in literature considers this problem in the scope of observability, however having a completely observable power system does not necessarily indicate having a uniquely identifiable topology. Therefore, the operator should know the branch statuses. One may utilize probabilistic approaches to determine the status of each branch, however those methods are vulnerable to the measurement errors and quality of the pseudo-measurements. This paper develops a numerical method that aims to find the identifiable branches, such that the branches whose status can be identified uniquely, based on the available measurement set, but not measurement readings. The proposed method employs a strategical ordering and Cholesky factorization to improve the computational performance. Moreover, the paper presents the optimum location of the measurement devices that is required to satisfy complete topology identifiability. The proposed method is assessed by means of a real-life system and the well-known IEEE test systems.
Subject Keywords
Distribution Systems
,
Measurement Placement
,
Ring Detection
,
Strategical Search
,
Topology Identifiability Analysis
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85126369124&origin=inward
https://hdl.handle.net/11511/97644
Journal
Electric Power Systems Research
DOI
https://doi.org/10.1016/j.epsr.2022.107911
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
A longest path problem for evaluating the worst case packet delay of switched ethernet
Schmidt, Klaus Verner; Schmidt, Şenan Ece (2010-07-09)
In the recent years, the use of real-time Ethernet protocols becomes more and more relevant for time-critical networked industrial applications. In this context, this paper presents a method to compute the worst-case packet delays on switched Ethernet. Based on an evaluation of the packet delays at each switch port and the network topology, we construct a weighted directed graph that allows to find the worst-case end-to-end packet delay by solving a conventional longest-path problem.
Improving performance of network intrusion detection systems through concurrent mechanisms
Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003)
As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
A new algorithm and computation approach for economic dispatch with prohibited operating zones in power systems
Cetinkaya, N; Urkmez, A; Erkmen, İsmet; Yalcinoz, T (2005-01-01)
This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the LLD problem. If production units cost Curves are represented property then ELD becomes More Correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the prod...
In-orbit estimation of time-varying residual magnetic moment for small satellite applications
Söken, Halil Ersin (2013-09-16)
A method for in-orbit estimation of time-varying residual magnetic moment is presented for small satellite applications. The Unscented Kalman Filter is used as the estimator. Unlike the existing studies in the literature, unexpected abrupt changes in the residual magnetic moment are also considered. Sudden shifts in the mean of the residual magnetic moment is detected by a low pass filter applied to the normalized innovation of the Unscented Kalman Filter. Then, by using a simple approach, which does not re...
A Link delay computation method for the quality of service support in software defined networks
Balo, Efe; Güran Schmidt, Ece.; Department of Electrical and Electronics Engineering (2019)
Packet switched networks cannot provide tight delay bounds that are required by certain types of applications despite facilitating high throughput. Therefore, delay measurementtechniquesforpacket-switchednetworkshavealwaysgrabbedtheattention of the community to both utilize advantages of packet-switched networks and provide a realistic end to end delay prediction of packets. Software Defined Networking (SDN) isa new paradigmofpacket-switchednetworkingwhichgathersmanagement functionality of network in a logic...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. Eser, U. C. Yılmaz, E. Dursun, M. C. Cinalioglu, and M. Göl, “A Computationally Efficient Topology Identifiability Analysis of Distribution Systems,”
Electric Power Systems Research
, vol. 208, pp. 0–0, 2022, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85126369124&origin=inward.