disjoint heterogenous network algorithm

8/18/2019 Disjoint Heterogenous network Algorithm

1/24

ENERGY CONSERVATION USING DISJOINTMULTIPATH ALGORITHM FOR HETEROGENEOUS

WIRELESS SENSOR NETWORK

Y.PreethiReg. No. 3483018

Under the Guidance of

Mr. P.Saravanan M.E

1


2/24

OBJECTIVE

To minimize wireless sensor network energy consumed .

To maintain disjoint paths etween nodes in order to increase

network li!e time.

2


3/24

"#OB$E% I&E'TI(IE&

In e)isting algorithm* the disjointness o! the path etween

source to destination is not consider .+ence the reliaility o! the

path is poor in hea,y tra!!ic network.

The e)isting algorithms consider only homogenous nodes i.e.

nodes ha,ing limited energy. This limits duration o! data

transmission.

3


4/24

"#O"O-E& --TE%

Consider heterogeneous network i.e.* /se o! unlimited power

source node in the network along with common node which increases

network li!e time.

-elect the disjoint path etween source node and destination node*

since disjoint path are highly reliale.

4


5/24

"#O"O-E& %O&E$

Broad casting o! #oute

re0uest packets y-ource node

/sing #oute reply packets

!rom destination node* the

routing tale is updated yeach node.

Calculation o! paths

etween source nodeand the destination node

1hether the

path

selected is

&isjoint?

-end noti!y message

through &isjoint path

'odes that are not

selected are remo,ed

!rom the list

2djust the transmission power

to the re0uired le,el to reach

the !arthest node in the

neighoring list

Transmission o! &ata

,ia disjoint path

Energy Conserv!"on

Us"ng D"s#o"n! M$%!"&!'

A%gor"!'( For

He!erogeneo$s W"re%ess

Sensor Ne!)or*

Yes

-elect another

path No

5


6/24

CALCULATION OF DISJOINT PATH

6

=

343

334

333

ND

{ disjoint.5nodearecache i! *3*4 otherwisenm mn ND =≠


7/24

-I%/$2TIO' -ET/"

Pr(e!er V%$e

C'nne% !y&e 1ireless channel

Pro&g!"on (o+e% Two #ay 6round

S"($%!"on re 4733 ) 4333 m8

N$(,er o- (o,"%e no+es 433

Trns("ss"on rnge 893m

No+e (ov"ng s&ee+ 49m: s

Move(en! (o+e% #andom way point

MAC !y&e IEEE ;38.44

P$se !"(e 3s

P(. 4.3

P("n 3.<

Tr"n"ng e.e/$!"on !"(e =33 s

7


8/24

The simulation is per!ormed using '-5 8.. The per!ormance o!

disjoint path is measured y calculating

Throughput

&elay

Jitter

'etwork $i!etime

"acket &eli,ery #atio

'ormalised %2C O,erhead.

8


9/24

'ET1O#? -ET/" -CE'2#IO

9

-ensor nodes and super

nodes are deployed

randomly . The sensor nodes are

initially assigned with a

energy o! aout 9 mJThe super nodes are

connected to main power

supply.


10/24

I'ITI2$ "2T+

10

1hen a source node wants to

transmit data to the destinationnode* it initiates route re0uest

process.This process in,ol,es roadcasts

#oute #e0uest packets to all o! itsneighoring nodes.2!ter that a route reply packets

are sent y destination node

towards the sender node.

Based on the ##"$ packets therouting tale is updated2mong multiple paths* the

disjoint path selected is ased the

&+' algorithm.


11/24

'E1 "2T+ -E$ECTIO'

11

+ere the node is mo,ed !rom itsinitial position ased on the random

way point model . Because o! this e,ent the path

etween the source node and the

destination node is detached anddata transmission etween nodes is

interrupted.+ence the source node once

again initiates route disco,ery process and !inds new disjoint path

!rom the a,ailale path sets ased

on the &+' algorithm.


12/24

PATH 0 SELECTION

12

-election o! path 8 a!ter

!ailure o! one o! the nodes in path 4. This is due to

prolonged use o! that node

which results in degradation o!

node residual energy.2s a result the node energy is

!ully drained and dies which

results in link !ailure. +ence

the source node once again

initiates route disco,ery

process and !inds new disjoint

path !rom the a,ailale path

sets ased on the &+'

algorithm.


13/24

&E$2

The delay is increased as

the data tra!!ic time increases.-ince the amount o! data

increases !rom time to tine the

network gets congested

The delay is

comparati,ely low when

compared to other protocols.

13


14/24

T+#O/6+"/T

Throughput !or &isjoint

%ultipath +eterogeneousnetwork which decreases

due to increase in

congestion with increase in

time.

+ence it is not deli,ered

to destination node which

increases packet loss.

There!ore the

Throughput decreases with

increase in time. 14


15/24

JITTE#

Jitter is the delay ,ariation

etween each recei,ed data

packets.The ,ariation in the packet

arri,al time should e

minimum to ha,e etter

per!ormance.

15


16/24

'ET1O#? $I(ETI%E

&ata transmission increases

with time* the residual energyo! the sensor node keeps on

decreasing with time.In heterogeneous network

ha,ing super nodes* the longdistance data transmission is

carried y neighoring super

node and sa,ing the residual

energy o! the sensor node !or

!urther data transmission.This increases the o,erall

network li!etime .16


17/24

#E-I&/2$ E'E#6

17

2s the data transmission

increases with time* the

remaining energy o! the

transmission node keeps on

decreasing with time.+eterogeneous network

ha,ing super nodes* the longdistance data transmission is

carried y the neighoring

super node and sa,ing the

residual energy o! the sensornode !or !urther data

transmission. This increases the o,erall

network residual energy.


18/24

'O#%2$I@E& %2C OVE#+E2&

The normalized %2C load

is de!ined as the !raction o!

all control packets Arouting

control packets* Clear5to5

-end* #e0uest5to5-end*

2C?s o,er the total numer

o! success!ully recei,ed data packets.&isjoint link etween

transmission and recei,er

which is stale the necessityo! routing o,erhead due to

!inding a new path is

reduced.18


19/24

"2C?ET &E$IVE# #2TIO

The network starts

congestion with increasesdata packets in 0ueue. 1hen the 0ueue is !ull*

the packets arri,ed starts

drop and hence results in

packet loss.But in disjoint path

which are more dedicated

!or particular transmission

and hence the proailityo! congestion is lower and

thus increases packet

deli,ery ratio. 19


20/24

CO'C$/-IO'

20

The algorithm selects disjoint path among many a,ailale paths

which impro,es the reliaility and packet deli,ery ratio o! the

network path.

-ince the proaility o! !ailure o! path is reduced* the !re0uent

roadcasting o! ##E packets !or !inding new paths is reduced.

This sa,es network energy and also reduces delay.

Increases the li!etime o! network compared to other algorithms.


21/24

(/T/#E 1O#?

21

+ence the proposed algorithm can e e)tended y selecting

optimum neighor nodes !or routing those ##E packets which

reduces network o,erheads at initial route !inding phase y

eliminating redundant roadcasting o! ##E packets.


22/24

#E(E#E'CE-

D4+akki Bagci*Irahim ?orpeoglu*and 2dnan azici. 2

&istriuted (ault Tolerant Topology Control 2lgorithm (or

+eterogeneous 1ireless -ensor 'etworks In IEEE Transaction

*Vol.87*no.>.2pril 8349

D8F. 1ang* %. -heng* %. $iu* &. @hai* and . @hang* G#E-"H 2

k5connected residual energy5aware topology control algorithm !orad hoc networks* in "roc. IEEE 1ireless Commun. 'etw. Con!.*

834

D


23/24

D9 I. (. 2kyildiz and I. +. ?asimoglu* G1ireless sensor and

actor networksH #esearch challenges* 2d +oc 'etw.* ,ol. 8* no.

>* pp.


24/24

T+2'? O/

24

disjoint heterogenous network algorithm

Documents