ENERGY CONSERVATION USING DISJOINT

MULTIPATH ALGORITHM FOR HETEROGENEOUS

WIRELESS SENSOR NETWORK
Y.Preethi

Reg. No. 3483018

Under the Guidance of

Mr. P.Saravanan M.E

OBJECTIVE
To minimize wireless sensor network energy consumed .
To maintain disjoint paths between nodes in order to increase
network life time.

PROBLEM IDENTIFIED
In existing algorithm, the disjointness of the path between
source to destination is not consider .Hence the reliability of the
path is poor in heavy traffic network.
The existing algorithms consider only homogenous nodes i.e.
nodes having limited energy. This limits duration of data
transmission.

PROPOSED SYSTEM
Consider heterogeneous network i.e., Use of unlimited power
source node in the network along with common node which increases
network life time.
Select the disjoint path between source node and destination node,
since disjoint path are highly reliable.

PROPOSED MODEL
Using Route reply packets
from destination node, the
routing table is updated by
each node.

Broad casting of Route

request packets by
Source node

Energy Conservation
Using Disjoint Multipath

Select another
path
No

Algorithm For

Whether the
path
selected is
Disjoint?
Yes

Heterogeneous Wireless
Sensor Network

Transmission of Data
via disjoint path

Calculation of paths
between source node
and the destination node

Send notify message

through Disjoint path

Adjust the transmission power

to the required level to reach
the farthest node in the
neighboring list

Nodes that are not

5
selected are removed
from the list

CALCULATION OF DISJOINT PATH

000

ND 001
010

NDnmn m

0 , if cache are node - disjoint.

1, otherwise

SIMULATION SETUP
Parameter

Value

Channel type

Wireless channel

Propagation model

Two Ray Ground

Simulation area

1600 x 1000 m2

Number of mobile nodes

100

Transmission range

250m

Node moving speed

15m/ s

Movement model

Random way point

MAC type

IEEE 802.11

Pause time

0s

Pmax

1.0

Pmin

0.3

Training execution time

900 s

The simulation is performed using NS- 2.34. The performance of

disjoint path is measured by calculating
Throughput
Delay
Jitter
Network Lifetime
Packet Delivery Ratio
Normalised MAC Overhead.
8

NETWORK SETUP SCENARIO

Sensor nodes and super
nodes are deployed
randomly .
The sensor nodes are
initially assigned with a
energy of about 5 mJ
The super nodes are
connected to main power
supply.

INITIAL PATH
When a source node wants to
transmit data to the destination
node, it initiates route request
process.
This process involves broadcasts
Route Request packets to all of its
neighboring nodes.
After that a route reply packets
are sent by destination node
towards the sender node.
Based on the RRPLY packets the
routing table is updated
Among multiple paths, the
disjoint path selected is based the
DHN algorithm.

10

NEW PATH SELECTION

Here

the node is moved from its

initial position based on the random
way point model .
Because of this event the path
between the source node and the
destination node is detached and
data transmission between nodes is
interrupted.
Hence the source node once
again initiates route discovery
process and finds new disjoint path
from the available path sets based
on the DHN algorithm.

11

PATH 2 SELECTION
Selection of path 2 after
failure of one of the nodes in
path 1. This is due to
prolonged use of that node
which results in degradation of
node residual energy.
As a result the node energy is
fully drained and dies which
results in link failure. Hence
the source node once again
initiates
route
discovery
process and finds new disjoint
path from the available path
sets based on the DHN
algorithm.

12

DELAY

The delay is increased as

the data traffic time increases.
Since the amount of data
increases from time to tine the
network gets congested
The

delay

is

comparatively

low

when

compared to other protocols.

13

THROUGHPUT
Throughput for Disjoint
Multipath Heterogeneous
network which decreases
due to increase in
congestion with increase in
time.
Hence it is not delivered
to destination node which
increases packet loss.
Therefore the
Throughput decreases with
increase in time.

14

JITTER
Jitter is the delay variation
between each received data
packets.
The variation in the packet
arrival time should be
minimum to have better
performance.

15

NETWORK LIFETIME
Data transmission increases
with time, the residual energy
of the sensor node keeps on
decreasing with time.
In heterogeneous network
having super nodes, the long
distance data transmission is
carried by neighboring super
node and saving the residual
energy of the sensor node for
further data transmission.
This increases the overall
network lifetime .

16

RESIDUAL ENERGY
As

the data transmission

increases with time, the
remaining energy of the
transmission node keeps on
decreasing with time.
Heterogeneous network
having super nodes, the long
distance data transmission is
carried by the neighboring
super node and saving the
residual energy of the sensor
node for further data
transmission.
This increases the overall
network residual energy.

17

NORMALIZED MAC OVERHEAD

The normalized MAC load
is defined as the fraction of
all control packets (routing
control packets, Clear-toSend, Request-to-Send,
ACKs) over the total number
of successfully received data
packets.
Disjoint link between
transmission and receiver
which is stable the necessity
of routing overhead due to
finding a new path is
reduced.

18

PACKET DELIVERY RATIO

The
network
starts
congestion with increases
data packets in queue.
When the queue is full,
the packets arrived starts
drop and hence results in
packet loss.
But in disjoint path
which are more dedicated
for particular transmission
and hence the probability
of congestion is lower and
thus increases packet
delivery ratio.

19

CONCLUSION
The algorithm selects disjoint path among many available paths
which improves the reliability and packet delivery ratio of the
network path.
Since the probability of failure of path is reduced, the frequent
broadcasting of RREQ packets for finding new paths is reduced.
This saves network energy and also reduces delay.
Increases the lifetime of network compared to other algorithms.
20

FUTURE WORK
Hence the proposed algorithm can be extended by selecting
optimum neighbor nodes for routing those RREQ packets which
reduces network overheads at initial route finding phase by
eliminating redundant broadcasting of RREQ packets.

21

REFERENCES
[1]Hakki Bagci,Ibrahim Korpeoglu,and Adnan Yazici. A
Distributed Fault Tolerant Topology Control Algorithm For
Heterogeneous Wireless Sensor Networks In IEEE Transaction
,Vol.26,no.4.April 2015
[2]X. Wang, M. Sheng, M. Liu, D. Zhai, and Y. Zhang, RESP: A
k-connected residual energy-aware topology control algorithm for
ad hoc networks, in Proc. IEEE Wireless Commun. Netw. Conf.,
2013, pp. 10091014
[3] G. Anastasi, M. Conti, M. Francesco, and A. Passarella,
Energy conservation in wireless sensor networks: A survey, Ad
Hoc Netw., vol. 7, no. 3, pp. 537568, 2009.
[4] Y. Wang, Topology control for wireless sensor networks,
inWireless Sensor Netw. Appl., pp. 113-147, Chapter 5, 2008,DOI:
22
10.1007/978-0-387-49592-7_5

[5] I. F. Akyildiz and I. H. Kasimoglu, Wireless sensor and

actor networks: Research challenges, Ad Hoc Netw., vol. 2, no.
4, pp. 351367, 2004.
[6] M. Yarvis, N. Kushalnagar, H. Singh, A. Rangarajan, Y. Liu,
and S.Singh, Exploiting heterogeneity in sensor networks, in,
in Proc.IEEE Int. Conf. Comput. Commun., 2005, vol. 2, pp.
878890.
[7] Y. Wang, Topology control for wireless sensor networks,
inWireless Sensor Netw. Appl., pp. 113-147, Chapter 5,
2008,DOI: 10.1007/978-0-387-49592-7_5
[8] X. Wang, M. Sheng, M. Liu, D. Zhai, and Y. Zhang, RESP:
A k-connected residual energy-aware topology control
algorithm for ad hoc networks, in Proc. IEEE Wireless
Commun. Netw. Conf.,2013, pp. 10091014
23

THANK YOU

24