SRI JAYACHAMARAJENDRA COLLEGE OF ENGINEERING

MYSURU-570006
department of information science and engineering

Report
on
QOS scheme for manet energy based routing and Analysis of
congestion control in wireless mesh network

Submitted by
name roll no usn
Tharini M S 53 4JC12IS055
Uma D V 54 4JC12IS056
Vikas M V 55 4JC12IS057
Vinayak Milind 56 4JC12IS058
Submitted to
S P Shiva Prakash
Assistant Professor
Dept of IS&E,SJCE Mysuru.

Affiliated to
VISVESVARAYA TECHNOLOGICAL UNIVERSITY
BELAGAVI
Contents
1 QOS scheme for MANET energy based routing 1
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.3 Low Delay . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.4 Low jitter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.5 Packet Loss . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2

2 Study on Congestion Control in Wireless mesh networks and

factors affecting it 3
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Proposed logical model . . . . . . . . . . . . . . . . . . . . . . 3
2.2.1 Description . . . . . . . . . . . . . . . . . . . . . . . . 4
2.3 Step by step procedure . . . . . . . . . . . . . . . . . . . . . . 4
2.4 Constraints for algorithm . . . . . . . . . . . . . . . . . . . . . 5
2.4.1 Energy Rules . . . . . . . . . . . . . . . . . . . . . . . 5
2.5 Channel Allocation Rules . . . . . . . . . . . . . . . . . . . . 5
2.6 Initial energy . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.7 Analysis steps for distance criteria . . . . . . . . . . . . . . . 8
2.8 Analysis steps for velocity criteria . . . . . . . . . . . . . . . 9
2.9 Analysis steps for angular displacement criteria . . . . . . . . 11
1 QOS scheme for MANET energy based rout-
ing
1.1 Introduction
Mobile Ad hoc network (MANET) can operate in a self-organized and do
not have any predefined infrastructure. The mobile in such network can
communicate with each others through direct wireless links or multi-hop
routing. It has been used in a wide range of applications ranging from a
battlefield to the users living room. However, due to the limit battery energy
of mobile nodes, how to prolong the lifetime of nodes as well as network
becomes the key challenge in MANET, and it has received a lot of attention.
Existing methods for energy conservation are focus on transmission power
control and dynamic turning off active nodes in network. There are many
existing protocols and the major drawback of them is that it neglects the
importance of energy resource during slot allocation which plays a major role
in network performance. Also considering mobility of a node which results in
high congestion due to frequent link breakages and high energy consumption
due to re-establishment of route during routing process. Also considering
mobility of a node which results in high congestion due to frequent link
breakages and high energy consumption due to re-establishment of route
during routing process.

1.2 Abstract
The proposed model reduces energy consumption in mobile ad hoc networks
by optimization slot allocation by clusterheads during packet transmission
and the corresponding QoS parameters are identified in this energy saving
mode operation. It also analyze the congestion control in the wireless mesh
network and factors affecting it.

1.3 Low Delay

Low delay in packet transmission from node N1 to node N2 is satisfied by
immediate transfer of a node from light sleep mode to active mode.This
can be achieved by having remaining energy of a node > remaining energy
threshold.The minimal delay that will be incurred in this case is directly
proportional to the difference of energies in the two states and time.

E(rem, time) = k(RE RT )t

1
 k is the proportionality constant that is a scalar variation of the energies.
RE Remaining energy of a node
RT Remaining energy threshold

1.4 Low jitter

Jitter is the deviation from time periodicity of a presumed periodic signal.
Measuring jitter is critical element to determine the performance of the net-
work.

(packet arrival + 1) (packet start + 1) (packet arrival) (packet start)

Averagejitter =
n1

(P A + 1) (P S + 1) (P A P S )
Average jitter =
n1
P A packet arrival
P S packet start
n N umber of packets
To reduce jitter ,
PA
= PS
In this case,the average jitter turns out to be 0.

1.5 Packet Loss

The packet loss metric affects the perceived quality of application.
P
(P L )
P acket loss = P 100
(P S )
P L Lost P acket size
P S P acket size

Lost packet size can be reduced considerably by having more buffers in case
of a network congestion and reducing packet errors by providing checksum.

2
2 Study on Congestion Control in Wireless
mesh networks and factors affecting it
2.1 Introduction
Efficient slot allocation and scheduling is needed in congestion control algo-
rithms to improve the performance of such networks.The drawback of ex-
isting protocols is that it neglects the importance of energy resource during
slot allocation which plays a major role in network performance. Also con-
sidering mobility of a node which results in high congestion due to frequent
link breakages and high energy consumption due to re-establishment of route
during routing process.

2.2 Proposed logical model

Fuzzy Logic is used in this work as main implementation of perceptive rea-
soning. Fuzzy logic imitates the logic of human thought, which is much less
rigid than the calculations computers generally perform. Fuzzy Logic offers
several unique features that make it a particularly good alternative for many
control problems. It is inherently robust since it does not require precise,
noise-free inputs and can be programmed to fail safely. The output control
is a smooth control function despite a wide range of input variations. Since
the FL controller processes user defined rules governing the target control
system, it can be modified and tweaked easily to improve or drastically alter
system performance. Fuzzy Logic deals with the analysis of information by
using fuzzy sets, each of which may represent a linguistic term like Warm,
High etc. Fuzzy sets are described by the range of real values over which the
set is mapped, called domain, and the membership function. A membership
function assigns a truth value between 0 and 1 to each point in the fuzzy
sets domain. Depending upon the shape of the membership function, var-
ious types of fuzzy set can be used such as triangular, beta, PI, Gaussian,
sigmoid etc. A Fuzzy system basically consists of three parts: fuzzifier, infer-
ence engine, and defuzzifier. The fuzzifier maps each crisp input value to the
corresponding fuzzy sets and thus assigns it a truth value or degree of mem-
bership for each fuzzy set. The fuzzified values are processed by the inference
engine, which consists of a rule base and various methods for inferring the
rules. The rule base is simply a series of IF-THEN rules that relate the in-
put fuzzy variables with the output fuzzy variables using linguistic variables,
each of which is described by a fuzzy set, and fuzzy implication operators
AND, OR etc. The part of a fuzzy rule before THEN is called predicate
or antecedent, while the part following THEN is referred to as consequent.

3
 The combined truth of the predicate is determined by implication rules such
as MIN-MAX (Zadeh) and bounded arithmetic sums. All the rules in the
rule-base are processed in a parallel manner by the fuzzy inference engine.

2.2.1 Description
The objective of our fuzzy routine is to determine the value of cost for a link
between two mesh nodes such that the life of a mesh network is maximized.
The lifetime of wireless mesh networks is generally defined as the time when
the energy level of the first mesh node becomes zero. The fuzzy rule base
has been tuned so as to not only extend the life time of the mesh network
but also to balance the routing load among mesh nodes effectively so that
a maximum number of nodes have sufficient energy to continue performing
their own receiving tasks. The input fuzzy variables are:

Transmission Energylow, high

Remaining Energylow, medium, high

Rate of Energy Consumptionlow, medium, high

Queue Sizesmall, large

Distance from gateway small, large

The rule base therefore consists of 24 x32 = 144rules. There is a single output
fuzzy variable, namely cost the defuzzified value of which determines the cost
of link between two mesh nodes. In determining the cost of link from node
x to node y, Transmission Energy represents the energy needed to transmit
a data packet from node x to y. Lower value of transmission energy leads to
lower link cost.

2.3 Step by step procedure

Initialise the network, decide the source and destination

Initialise the threshold, number of nodes.

Obtain the initial energies of all the nodes.

Decide upon the factors affecting routing

Calculate Remaining energy of all nodes

Obtain the drain rate of the nodes

4
 Obtain the effect impact and velocity and pause time for the nodes
Obtain the activeness of the nodes, active ,inactive

Decide the packet routing based on rules of the factors

Find the other node to transmit or drop the packet

2.4 Constraints for algorithm

2.4.1 Energy Rules
When node 2 wants to transmit packets to node 1, then the energy of
node1 node2 this is because the receiver node may need to transmit to
other nodes consequently. Also ,it may also be the case that node3 has to
transmit to node1. These constraints can be formulated mathematically as
follows

N 1 Receiver node
n2, n3, n4, ...... T ransmitting nodes to N 1
E(N 1) E(n2) + E(n3) + E(n3) + ...
n
X
E(N 1) E(ni )
i=2

In the case that E(N1) is not greater than the sum of transmitting nodes,then
only those nodes that have sum of energies lesser than N1 may transmit. The
equation can then be reformed as,
m
X
E(N 1) E(ni )
i=2

where m is the number of nodes that have energy less than or equal to
N1.

2.5 Channel Allocation Rules

A node wishing to make a packet transmission to another node is allocated
the channel only if the following conditions are met

5
 The energy of node is greater than minimum threshold energy

E N E th

No other node is transmitting in the channel.This can happen if all the

nodes are in either deep sleep or light sleep but not active.The only
nodes which are active are the transmitter node(N2) and receiver node
(N1).
E ni < E th i
/ 1, 2
or whichever are the transmission nodes.

2.6 Initial energy

Diagram of a single frame

TF F rame duration
TCSF Contention sub f rame duration
TDSF Data sub f rame duration
TB Beacon duration
TCS Contention slot duration
TH Header slot duration
TISS IS slot duration
TIS IS sub slot duration
TD Data slot duration
nCS N o. of contention slots
nIS N o. of IS slots

6
 nDS N o. of data slots
TF = TCSF + TDSF (1)
TCSF = TB + TCS + TH + TISS (2)
TDSF = nDS TDS (3)
TCS = nCS TC (4)
TISS = nIS TIS (5)
TCSF = TB + (nCS TC ) + TH + (nIS TIS ) (6)
TF = TB + (nCS TC ) + TH + (nIS TIS ) + (nDS TDS ) (7)

Considering the situation with 5 frames, each frame having 8 slots. A set
of 5 nodes transferring 10 packets each using these 5 frames follows the con-
straints:

1. Each node is allocated to one frame

2. A node may use a frame only at the beginning of a time frame and
not otherwise.

Allocation is done by having each node wait for the entire cycle to finish
and then start allocating slots at the beginning of each frame.
Mathematically,this can be represented as:

Node 1:
t1 = 8 packets allocated

7
 k1 = 2 packets remaining
2 packets are allocated in the next time frame. So it has to wait for 5 time
frames i.e 5s.
Node 2:
t2 = 8 packets allocated
k2 = 2 packets remaining
N2 waits for next time frame. So for 5 nodes,the total delay would be a
function of the no. of frames and no. of nodes.

T delay (f, n) = 5 + 5 + 5 + 5 + 5 = 5 5 = n2

No. of slots per frame = 8.

k N o. of slots
n N o. of nodes

The delay occurring due to packet allocation of the remaining packets that
were not allocated in the beginning of the first time frame = 8*n

k = TF (8)

Substituting TF f rom (15), we have

k = TB + (nCS TC ) + TH + (nIS TIS ) + (nDS TDS ) (9)

T delay (k, n) = kn[k = no. of slots]

So, total delay = T delay (f, n) + T delay (k, n)
T delay (f, k, n) = n2 + kn

T otal delay = n(n + k) (10)

T otal delay = n(n + TB + (nCS TC ) + TH + (nIS TIS ) + (nDS TDS ))
(11)

T otal delay = 5(5 + 8) = 65s

2.7 Analysis steps for distance criteria

Hence, Considering the radius of connections as 5 unit the energy distance
factor can be obtained by :
CASE 1: SINGLE NODE IN THE AREA

8
 Energy dissipated X Euclidian distance .

CASE 2: MORE THAN ONE NODE IN THE RECTANGULAR AREA

Here the energy dissipation depends on the node with significance.

= (ex1d1)/(e1d1) + (ex2d2)/(e2d2) + (exndn)/(endn) (12)

At boundary
= ex(l b) (13)
ex - energy level of significance node
di - distance between nodes(Euclidian)

CASE 3:NO NODE IN THE RECTANGULAR SPACE IS CONSID-

ERED
=0 (14)
since there is no other node to communicate

2.8 Analysis steps for velocity criteria

CASE 1: static nodes around the significant node

= energylevel distancecovered timef unction (15)

= ei 0 t(x) (16)

=0 (17)

9
Hence there is no significant change in energy drain rate due to a static node

CASE 2: when the node is moving towards the significant node

Z
= (energylevelof thenode distancetravelled t(x)/t(y)) (18)

Z
= (0to5)energylevelof thenode distance t(x)/t(y) (19)
Z
= ei di t(x)/t(y) (20)

T=time function in the x,y coordinate

CASE 3: when the node is moving away from the sig ificant node
Z
= (energylevelof thenode distancetravelled t(x)/t(y)) (21)

Z
= (0to5)energylevelof thenode negativedistance t(x)/t(y) (22)

Z
= ei di t(x)/t(y) (23)

T=time function in the x,y coordinate

10
2.9 Analysis steps for angular displacement criteria
Angular displacement of a node

= 1 2. (24)

Where
(25)
is the angular displacement,
The average angular velocity

w = (1 2)/(t1 t2) (26)

CASE 1:For one node in the vicinity the product factor is e*m , where m is
the slope
M = tan (27)

= tan 1(m) (28)

In this case there doesnt exist a slope since there is no more than one node.
CASE 2: for two nodes and more than two nodes

= tan 1(m) (29)

M = tan (30)
Where m is the slope The energy product factor ei*mi is given by
Xm
(ei mi)/( ei mi) (31)
n=1
,
where 1 to n are the number of nodes that are present in the network.
Xm
Energy dissipation f actor = (ei mi)/( ei mi) (32)
n=1

Energy dissipation factor is given by e*m , where e-energy dissipated

m-slope between two nodes

11
References
[1] S.P. Shiva Prakash, T.N. Nagabhushan, Kirill Krinkin. Energy Aware
Power Save Mode Management in Wireless Mesh Networks Proceeding
of the 14th Conference of Fruct Association, 2013.

[2] Bulent Tavli, Wendi Heinzelman. Mobile Ad Hoc Networks

12