Scribd
Upload
55 views26 pages

PCE 6237 Advanced Power System Analysis: Lecture One: Section Three

This document discusses network modeling and the formation of bus admittance matrices for power systems. It covers: 1. Modeling a power network using a bus admittance matrix where the diagonal elements are the short circuit driving point admittances and the off-diagonal elements are the short circuit transfer admittances. 2. Using graph theory concepts like trees, co-trees, incidence matrices to represent power networks and determine the elements of the bus admittance and impedance matrices. 3. Two methods for forming the bus admittance matrix - direct inspection of a simple 3-bus system and using a singular transformation on the primitive network model.

Uploaded by

Bedasa Tolera
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views26 pages

PCE 6237 Advanced Power System Analysis: Lecture One: Section Three

This document discusses network modeling and the formation of bus admittance matrices for power systems. It covers: 1. Modeling a power network using a bus admittance matrix where the diagonal elements are the short circuit driving point admittances and the off-diagonal elements are the short circuit transfer admittances. 2. Using graph theory concepts like trees, co-trees, incidence matrices to represent power networks and determine the elements of the bus admittance and impedance matrices. 3. Two methods for forming the bus admittance matrix - direct inspection of a simple 3-bus system and using a singular transformation on the primitive network model.

Uploaded by

Bedasa Tolera
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

PCE 6237

Advanced Power System Analysis

Lecture One: Section Three

Dr. Milkias B.
Dept. of Electrical Power and Control Engineering
University of Adama Science and Technologyy University
[email protected]
3. Network Modelling

3.1 Bus Frame of Analysis


3. Network Modelling
3.1 Bus Frame of Analysis
• For a network with n number of nodes (buses) excluding the reference node, a set
of following equations, one for each node can be written as

i.e.

Where Ii is the current entering the ith bus


Vm is the voltage to reference of bus m i.e.
Yim is the admittance between the buses i and m
where Ybus is the bus
Now (1.20) admittance matrix.
...
• Diagonal elements of bus admittance matrix Y11, Y22, Ynn are called the short circuit
driving point admittances of the system bases, and the off- diagonal elements are called
the short-circuit transfer admittances.
• Similarly, the diagonal elements of bus impedance matrices Z11, Z22… Znn are called
open circuit driving point impedances of the system bases, and the off-diagonal
elements are known as open circuit transfer impedances.
To find out the elements of Zbus and Ybus, we need
l. Primitive network
2. Graph theory
3. Incidence matrices
Network Graph Theory
• The geometrical structure of a network is sufficient to replace the network components by
a single line segment irrespective of the characteristic of the components.
• These line segments are called element and their terminals called nodes.

• A node and an element are incident if the node is the terminal of the element. Nodes can be incident to one
more elements.
• A graph shows the geometrical interconnection of' the element of a network. The rank of a graph is n-1, where
n is the number of nodes in the graph.
• A subgraph is any subset or the graph. If each clement of the connected graph is assigned a direction. it is then
called oriented graph.
• A graph is said to be planar. if it can be drawn without crossover of edges, otherwise it is called non-planar.
• Figure 1.15(a) shows the single line diagram of a simple power network consisting of generating stations,
transformer, transmission lines and loads.
• Figure l. 15(b) shows the positive sequence network of the system depicted in Figure 1.15(a).
• The oriented connected graph is shown in Figure 1.16 for the same system.
...
...
Tree and co-tree
• A tree is a connected subgraph of a network which consists of all nodes of the original graph but no
closed path.
• The graph of a network may have a number of trees. In general, if a tree contains n nodes, then it has (n
- l) branches.
• In forming a tree for a given graph, certain blanches are removed. The branches thus opened are called
links or link branches.
• The link for Figure 1.17, for example, is 5, 6 and 7. The set of all links of a given tree is called the co-
tree of the graph.
The relation between the number of nodes and the number
of branches in a tree is given by
b = n-1 1.26

• If e is the total number of elements, then the number of links l of a


connected graph with branches b is given by l = e-b 1.27
• Hence, from Eq. (1.26), the number of links l can be written as
l = e-n+1 1.28
A tree and the corresponding co-tree of the graph for the system are
Figure 1.17 Tree of the representative power shown in Figure 1.17 and Figure 1.18.
system of Figure 1.15(a).
...

Figure 1.18 Co-tree of the representative power system of Figure 1.15(a).


Incidence Matrices
• Incidence matrices are mostly used in graph theory. They are significant in developing the different
networks matrices such as bus admittance matrix, bus impedance matrix using singular or non-
singular transformation.
• The following incidence matrices are of interest in power system analysis.
I. Element—node incidence matrices
2. Bus incidence matrix or element—bus incidence matrix
3. Basic loop incidence matrix
Basic cut-set incidence matrix
...
Basic loop incidence matrix (C)
The incidence of elements to basic loops of a connected graph is shown in Figure 1.9 by the basic loop
incidence matrix. The elements of this matrix
Cij=1 if the ith element is incident to and oriented in the same direction as the jth basic loop
Cij=-1 if the ith element is incident to and oriented in the opposite direction as the jth basic loop
Cij = 0 if the ith element is not incident to the Jth basic loop
Basic cut-set incidence matrix (D)
• The incidence of elements to basic cut-set of a connected graph is shown in Figure 1.20 by the basic
cut-set incidence matrix. The elements of this matrix are:
dij = 1 if the ith element is incident to the jth basic cut-set and oriented in the same direction of
the jth basic cut-set
dij = 1 if the ith element is incident to the jth basic cut-set and oriented in the opposite direction
of the jth basic cut-set
dij = 0 if the ith element is not incident to the jth basic cut-set
Formation of Bus Admittance Matrix [Ybus]
• The matrix consisting of the self admittance and the mutual admittance of the network of the power
system is called the bus admittance matrix Ybus.
• We will discuss here the following two methods by formulation of [Ybus].
• Direct inspection method
• Singular transformation method (Primitive network)

Direct Inspection Method


Consider a simple three bus system (Figure 1.21).
Let Il, I2 and I3 denote the current flowing into the buses.
Applying KCL at each node:

At Node 1

Therfore

Where
MATLAB Program for [Ybusl Formation Using the Direct Inspection Method

You might also like