Quantity & Head Requirement, Network Analysis
Quantity & Head Requirement, Network Analysis
ventilation systems to the students. Students will understand the fundamentals of the
OUTCOME OF THE COURSE: Students will come to know about different parameters
to be considered to plan and design a mine specific ventilation system. They will also learn
different methods and terminologies used to design a ventilation system for a mine.
List of Books
Interscience publication.
Streamlining of obstruction:
The objective of streamlining of an obstruction is to
minimize the form drag. However, there will be an
increase in friction drag by this process.
Hence, for streamlined obstructions, there will be an
optimum length for which the total drag would be
minimum.
At high values of ( > 2x104), is independent of .
And in mine application, is generally very high.
Shock losses due to bend
Shock loss due to bend is given by:
where x is shock factor
where the summation is over all airways in the closed path and
the Hl value for any airway is the algebraic sum of the friction
head, the natural ventilation head, and the fan head. Adoption
of a consistent sign convention is necessary for correct solution
to problems. Consider a closed path consisting of airways a, b,
c, and d, as indicated by the dashed line. If one sums the head
losses in a clockwise direction around this closed path, the
following equation can be written
+-
where , , and are positive, since the quantity Q1 flowing through
airways a, b, and c is flowing in the clockwise direction. Since
Q2 flows opposite to the direction of summation, there is a head
gain in d, or the head loss (is negative.
Kirchhoff’s Laws
2) the direction and quantity of airflow for each branch; except branch 1
In effect, there are 12 independent equations are needed. A set of equations is considered to be
independent if none of them can be derived from the remaining ones. In other words, each equation
must contain unique information, which cannot be obtained from the other equations. One half of the
required independent equations can be written from Atkinson’s equation, as follows:
Analysis of complex Networks
• The remaining six equations can be obtained from the Kirchhoff’s laws.
• A theorem of network topology states that there are exactly Nj-1 independent equations that
can be derived from Kirchhoff’s first law. These are obtained by setting the algebraic sun of
the quantities that leave each of the Nj-1 junction equal to zero. Therefore from fig. 5 one can
obtain three independent equations by applying Kirchhoff’s first law to junctions A,B and C:
• Junction A: - Q1+Q2+Q3 = 0
• Junction B: - Q2 + Q4 + Q6= 0
• Junction C: - Q3 - Q6 + Q5 = 0
• It should be noted that applying Kirchhoff’s first law to junction D would yield an equation
that can be derived from the above three equations; thus it is not independent.
• The remaining three equations are now left to be determined by Kirchhoff’s second law.
Analysis of complex Networks
• In fig. (b) one must apply Kirchhoff’s 2nd law to 3 meshes, hence
fulfilling the requirements of 12 independent equations. Selecting
the three meshes indicating in fig (b) and recalling that the fan
pressure must be included, yields the following equations:
• Mesh 1
• Mesh 2
• Mesh 3
Analysis of complex Networks
• The above mesh equations can be expressed in terms of the resistance and quantity of each branch which are as
follows:
• Mesh 1:
• Mesh 2: =0
• Mesh 3:
• Since Q1 is given, one is left to determine five quantities and the fan pressure. However five quantities can be
expressed in terms of two unknown (Q3 & Q6) by using the equations of Kirchhoff’s first law which are as follows:-
• Q2 = Q1 - Q3
• Q4 = Q2 - Q6 = Q1 - Q3 - Q6
• Q5 = Q3 + Q6
• If the above expression for Q2, Q4 and Q5 are substituted into equations of 2nd law, one is left with 3 equations and 3
unknowns. However, it is apparent that the exact solution of these three nonlinear simultaneous equations is futile.
As a result, iterative techniques using methods have successive approximations for analysing complex networks
have been utilized as a necessary alternative to the exact solution.
Some definitions of network
A mine ventilation system generally consists of a multiple
arrangement of airways to and from the surface and workplaces,
fans, and control devices, all interconnected to ensure air-quantity
and air-quality requirements throughout the mine. The term
ventilation network, analogous to electrical network, is often used to
describe the mine ventilation system. In considering ventilation
networks, it is often useful to have the following formal network
definitions that apply in analyzing complex ventilation networks
Node: A point where two or more segments (lines) or airways meet
or intersect. In a ventilation network, a node is called a junction.
Branch (arc): A connecting line between two nodes. In a ventilation
network, the connecting line or branch represents a mine airway or
a branch.
Some definitions of network
Figure 1: Ventilation system consisting of Figure 2: Reduced complex network with six
two shafts and a raise connected on two branches and four nodes.
levels by drifts
Some definitions of network
Graph: A set of nodes, with
certain pairs of the nodes
connected by branches.
Connecting graph: A graph in
which all the nodes are
connected together by branches.
Network: A graph with a flow of
some type associated with its
branches. A ventilation system is
normally a graph with airflows in Figure 2: Reduced complex network with six
its branches and is thus properly branches and four nodes.
referred to as a network.
Some definitions of network
Connected network: A network in
which the branches connect every
node to every other node. The
network in Fig. 2 is a connected
network with six branches (indicated
by bracketed numbers) and four
nodes (indicated by encircled
numbers).
Directed network: A network in which
each branch has a sign or direction
associated with it. By convention, a
positive sign is assigned when
traveling from the starting node of a
branch and a negative sign otherwise.
Some definitions of network
Degree of a node: The number
of branches that have that node
as an endpoint. For example, the
degree of node 2 in Fig. 2 is 3.
Mesh (cycle): A connected path
through the network in which
every node is of degree 2 with
respect to the path itself. For
example, in Fig. 2 the path
connecting nodes 1, 2, 3, 4, and
1 (branches 1-2, 2-3, 3-4, and 4-
1) is a mesh.
Some definitions of network
Tree (or spanning tree): A connected
graph containing branches that
connect all the nodes (i.e., a set of
branches spanning the nodes) but
create no meshes.
Branch in a tree: A branch that is
contained in a spanning tree.
Chord (basic branch): A branch
contained in the network but not in a
given spanning tree.
Basic mesh: A basic or fundamental
mesh in a network is a mesh containing
only one chord and the unique path
formed by branches in the tree
between the two nodes of the chord.
Some definitions of network
Chord set: A set containing all the chords of a
network. There is a unique set of chords for a
particular spanning tree.
Mesh base: A set containing all the basic meshes.
There is a unique set of basic meshes for a particular
spanning tree.
Network degree: For a connected network, the
network degree is equal to the number of chords.
Spanning Tree Algorithm
A spanning tree of a network can be created using
the following algorithm:
• Step 1: Choose any node.
• Step 2: Considering only the nodes that are one
branch away from the chosen node, arbitrarily
connect another node to the chosen node. The
result is a connected set of nodes. Proceed to
step 3.
• Step 3: Considering only the nodes that are one
branch away from the connected set of nodes,
arbitrarily connect another node to the
connected set. Proceed to step 4.
• Step 4: If all nodes are in the connected set,
then stop. Otherwise, return to step 3.
The graph that results is one spanning tree of the
network.
Minimum resistance spanning Tree
If the Hardy Cross iterative technique is to be used to solve
the network, the procedure will normally converge in fewer
iterations if the minimum resistance spanning tree is used as
the basis of the iterative method. The minimum-resistance
spanning tree is obtained by first calculating the resistance of
each airway in the network. If we consider the resistance of
each airway as a "distance," then we can find the minimum-
resistance spanning tree by utilizing the following procedure:
• Step 1: Choose any node arbitrarily, and then connect it
to the closest adjacent node.
• Step 2: Find the unconnected node nearest to a
connected node, and then connect the two nodes.
• Step 3: If all nodes are connected, stop. Otherwise,
repeat step 2.
The results of this procedure on the network in Fig. 2 are
shown in Fig. 3(b). The minimum-resistance spanning tree is
shown in bold lines. This tree will be identical regardless of
the node at which the branch selection is initiated unless ties
occur when the final branches are chosen.
Representing network in Matrix
Incident Matrix:
The incident Matrix denoted by a Aa, of a
network is a matrix of order in nn × nb. If Aa
= [aij], then the values of aij are defined as
follows:
aij = +1 if branch j is incident at node i and
is directed away from node i.
aij = -1 if branch j is incident at node i and
is directed toward node i.
aij = 0 if branch j is not incident at node i.
Aa =
Reduced Incident Matrix
Reduced Incident Matrix:
Observed that each column of Aa contains exactly two non-zero
elements, one +1 and one -1. Since the columns of A a have this
property, we may remove one of its rows without losing any
information. The (nn – 1) × nb matrix obtained by deleting a row
from Aa is denoted by A and is called the reduced incident matrix
or basis incident matrix. All rows of A are linearly independent and
hence its rank is nn – 1. The node corresponding to the deleted
row of Aa is referred to as the reference node of the network .
Aa =
Fundamental mesh Matrix
The fundamental meshes of a network with respect to a tree are
the m meshes, each being formed by a chord and a unique chain
in the tree connecting to end points of the chord. The direction of
fundamental meshes is chosen to agree with that of the defining
chord. Each fundamental mesh contains only one chord is
contained in just one mesh. Mathematically, the fundamental
meshes of a network with respect to a tree can be represented by
the fundamental mesh matrix B. If B = [bij], then the elements are
defined as follows:
bij = +1 if branch j is contained in mesh i and has the same
direction
bij = -1 if branch j is contained in mesh i and has the opposite
direction
bij = 0 if branch j is NOT contained in mesh i
Fundamental mesh Matrix
B=
Network Variables
The conventional analysis of mine ventilation networks is generally
based on the assumption of incompressibility of air involved with
steady-state flow and the following variables:
hLj : Head loss for branch j (Pa)
hRj : Head loss for regulator in branch j (Pa) [ hRj : may be included in
hLj as well ]
hFj : Head (Pr. rise) for fan in branch j (Pa)
hNj : NVP (Pr. rise) in branch j (Pa)
rj : Resistance for branch j (Ns2 m-8)
qj : Air quantity flow for branch j (m3s-1)
Assuming validity of Atkinson’s Equation for all branches in a network,
This form takes care for the proper sign for hLj when qj is -ve.
Network Variables
Depending on the application, rj may include the components for
stock losses in the branch and/or at a node of the branch. If
desired, the velocity head at the exhaust end of the ventilation
system, which is proportional to the square of the air quantity,
can be converted into an eq equivalent resistance factor and
incorporated in rj for branch j, whose terminal node corresponds
to and exhaust.
NVP (hNj) will be considered as a given constant.
Fan head (hFj) is generally approximated by a second degree
polynomial.
Both hNj and hFj represent pr. rise, and their signs are based on the
direction of branch j.
Kirchhoff’s First Law
Kirchoff’s current law for mine ventilation network
can be expressed as:
Where,
Assume that the kth equation in the above set of mesh equation can be
considered to be a function of qk only where qk is the air quantity for the
chord contained in mesh k. Thus
Hardy Cross Method
The Hardy cross method is an iterative technique, that is, and appropriate
solution is successively improved until the error is acceptably small. It
assumes that each equation is a function of only one variable and utilises
two terms of Taylor’s series in the derivation of the improvement formula.
Suppose all air quantities are initially given the values such that the
equation
Assume that the kth equation in the above set of mesh equation can be
considered to be a function of qk only where qk is the air quantity for the
chord contained in mesh k. Thus