Ppt 3 Review

8/2/2019 Ppt 3 Review

1/33

High Level Parameter Analysis in WSN

Based on WMCL Algorithm

PRESENTED BY,

M. Abinaya

M. Shafina

GUIDED BY,

Mr. M. Vasim Babu, M.E(Ph.D.,)

Asst. Professor


2/33

ABSTRACT

In this project we propose an energy efficient algorithmcalled WMCL combine With AODV to analyze high level

parameter like RSSI,TOA,Error probability, Packet

transmission ratio.

Achieve both high sampling efficiency and high localizationaccuracy in various developments.

Our method can further reduce the size of a sensor nodes

bounding-box by a factor of up to 87 percent , and We achieve

localization accuracy by a factor of up to 98 percent.

Uses the estimated position information of sensor nodes to

improve localization accuracy.


3/33

EXISTING WORK

In this method localization algorithms for mobile sensornetworks are usually based on the Sequential Monte Carlo

(SMC) method.

They either suffer from low sampling efficiency or require

high beacon density to achieve high localization accuracy.

Although papers can be found for solving the above

problems separately, there is no solution which addresses both

problem.

They dont consider RSSI,TOA.Node density of sensor

network.


4/33

Power level and Range calculation are not mentioned.,

Minimum error rectification hence range free problem

can be occur.

Path loss and interferences cannot be considered.

Particularly RSSI cannot be computed or mentioned

here.

LIMITATIONS OF EXISTING ALGORITHM


5/33

PROPOSED WORK

We describe our proposed modified WMCL algorithm

combine with AODV.

We propose a set of algorithms which achieve both high

energy efficiency and high localization accuracy.

The results from our simulations and graphs validate the

effectiveness of our proposed algorithms.

Our method Improve of localization accuracy and reducethe energy consumption.


6/33

Algorithm Description

Minimal transmit power(MTP): Choose

the node with the minimal transmit power

Maximal energy-efficiency index (MEI)

Define the energy efficiency index of thek-th relay as the ratioof Ek to Pk,d andselect the relay with the maximalindex,

i.e.,

That is, the node whose transmit power

occupies the least portion of its current


7/33

Minimal outage probability(MOP): Inthis scheme, we select the node with the

smallest outage probability after it ischosen to transmit. We apply the strategyto the case

with the discrete power level by choosing

where 1k is an N1 column vectorwhose k-th elementis one and othersare equal to zero and the maximal powerconstraint is assumed infinity to have anode selection at hi h residual ener .


8/33

Start Setup phase

The nodes whose sensing area coverage is covered byneighbours forms temporary cluster heads

Select the desired number of CH for a round CH broadcast hello message

Clusters are formed depending on signal strength a nodereceives from different CHs

Nodes broadcast location, range and area they cover via hellomessage.

Nodes build a table of their neighbours depending on the hellomessage they receive from neighbours.

The temporary cluster heads and cluster heads forms the toplayer of communication

The sensor nodes forms the bottom layer of communication


9/33

Procedure to control the Transmissionpower (T, R) based on Makov process

Step: 1 Node Connected


10/33

AODV/MAC PROTOCOL:

Ad-hoc On Demand Vector protocol.

It uses table driven model and hance updating the routing

table contents for managing the network efficiently.

It may handle congestion even for the random

eploynmaent of large number of nodes.


11/33

The state transition diagram ofan energy-consuming process.


12/33

Other possible methods to improve AODV

congestion handling:

A route may predict when congestion is about

to occur and try to avoid it by reduce the

transmission rate.

Each node maintains a routing table thatcontains information about reaching destination

nodes.


13/33

Existing algorithmConcentrate on sampling efficiency and also having high

computational cost.

Proposed algorithm

Here we concentrate on all high level parameters such as

RSSI, Throughput,AOA,TOA, etc.,

Low computational cost

COMPARATIVE STATEMENT


14/33

Throughput Analysis:

Throughtput level is

more than the

existing system.

Here we achieved thethroughtput value of

35000 as the peak

value.


15/33

In the case of

simulation time Vs

throughtput graph

varies linearly. Thus we achieved 53

Mbps through our

algorithm.

Simulation time :


16/33

RSSI Analysis:

By using our algorithm

we maintained the sensor

energy level constant up

to 100m while existing

method does not.

This can dramatically

increases the life time of

the sensors.


17/33

Total Remaining Energy:

This energy is

approximately greater

than exsisting system in

the range of 1000 nano

joules.

These remaining energy

will help the sensor to

manage the multihop

system efficiently.


18/33

End To End Delay:

The minimization

average end to end delay

of the sensor nodes can

leads to energy efficient

algorithm.

Here we reduce the end

to end delay than the

Existing method.


19/33

Average Remaining Energy:

We can save energy

more than the exsisting

system in the order of

25 nano joules

comparitively.


20/33

Sensor Life Time:

We analyse the life time

of the sensor as the

special case.while

existing algorithm

cannot.

Constantly maintain the

life time even when the

number of roundsincrease.


21/33

Localization Accuracy:


22/33

PDR Analysis:

The efficiency of the

network depends upon

the delivery of packets at

particular time.

Hence our algorithm

have hiher PDR ratio

comparitively.


23/33

Error Probability Analysis:

The error probability canbe achieved to 0.3 while

existing system achieves

in the range of 0.7


24/33

SIMULATION RESULTS


25/33


26/33


27/33


28/33


29/33


30/33


31/33

CONCLUSION

In this paper, we present an approach does not requireadditional hardware on the nodes and works even when

the movement of seeds.

By using WMCL With AODV/MAC protocol we canhandle the congestion efficiently.

We are also mentioned the graph model, which helps to

compare the existing with the proposed work.

Reduces the computational and communicational cost.


32/33


33/33

Ppt 3 Review

Documents

Transcript of Ppt 3 Review