Pre Project Revised

B.
TECH PROJECT PRESENTATION 2018

National Institute of Science & Technology
Fault Tolerent Using Partioning Algorithm

for WSN
Project id:12087
By
Prajnya Prakash Rout Roll:201410266
Sachin Pradhan Roll:201410294
Under the guidance of

Mr. Bhabani Sankar Gouda
PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294)

[1]
B.TECH PROJECT PRESENTATION 2018
Presentation Outline
Problem Statement
Algorithm/ Models Used
Technology Used
Work Done
Outputs
Future Work
Reference
PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [2]

Problem Statement
A random uniform distribution of sensor nodes on a 2-D plane, a fast self-

organized distributed algorithm is proposed to find the maximum number of
partitions of the nodes such that each partition is connected and covers the area
to be monitored.Each connected partition remains active to cover the query
region individually. In case of a node failure the proposed distributed fault
recovery algorithm reconstructs the affected partition locally utilizing the available
free nodes.

Algorithm used
Fault Diagnosis
1. An array of 100 number of nodes is initialised.
2. The number of nodes will be given as input.
3. Let us assume the actual temperature of each of the nodes from
the array of nodes is 25 i.e. a [i] =25, where a[] is the array of nodes
and i is the number of neighbouring nodes.
4. The main purpose of generating individual node data of each and
every node is to find out the error generated in each of the nodes
which is added up to the actual assigned temperature and produces
the node data i.e. a[i]=a[i]+r, where a[i] is the array of neighbouring
nodes and r is the noise.
5. To find the noise(r) of each and every individual node, we have
taken a function randomval() which calculates the value of r.
Algorithm used cont.

6. Two random values t1 and t2 are generated using the rand()

function which gives two randomly generated numbers in the range
of 0 to 1.
7. The value of R is found out using the formula
R = sqrt(2*sig*sig*ln(1/1-t1))
8. The value of r is found out using the formula
r = mean + R cos (2*3.141*t2)
9. In this way the noise(r) is calculated for each of the nodes as per
the number of nodes inputted by the user.
a[i] = a[i] + r
10. After successful completion of all the steps, the node data of all
the individual nodes is displayed.


Fault Diagnosis cont.

1. Let us assume the initial fault status (IFS) of the number of nodes
entered by the user is 0. i.e. IFS[i] =0;
2. The probability of fault in the nodes (p) is then entered by the user
in the specified range i.e. within the range of 0.05 to 0.5.
3. The number of faulty nodes is then calculated by using the
formula, F=p*n;
Where F=Number of faulty nodes
p=probability of fault in the nodes
n=total number of nodes entered by the user
4. Then, the fault is introduced in the position generated by random
numbers using the rand() function and the generated numbers are
stored in the array random[i].

5. Initially the Updated Fault Status (UFS) of the entered number

of nodes is taken to be 0---
UFS[i] =0;
which is later replaced by 1 for those position of faulty nodes
which are stored in random[i] i.e.,
UFS[random[i]]=1;
6. Then, the updated fault Status of the entered number of nodes is
displayed i.e. 0 for fault-free nodes and 1 for faulty nodes.


l Coverage algorithm
l The first step will locate the sensors in the rows and columns
respectively such no sensor overlapped with others. As well as,
the distance between the centers of any two adjacent nodes is 2r
exactly .
l The second step is to deploy the leaders sensors. They deployed
such that the vertical distance from the leader center point to
other adjacent nodes not the other leaders nodes is 70% of 2r,
and the horizontal distance to adjacent leader nodes is 2r.
Fig.1 Coverage

Connectivity Algorithm
1. If G is a graph, replace each edge xy with arcs(x,y) and
(y,x).
2. Assign v as the source vertex and w as the sink vertex.
3. Assign the capacity of each arc to 1, and call the resulting
network H.
4. Find a max–flow function f in H .
5. Set λ(v,w) equal to the total flow of f. Stop.

Technology used
Object oriented language like c++,java

Ns-3
NetAnim

Work done till date

Noise Mean
Ratio media Mean Media
n of n of
mean media
n
DA FAR DA FAR DA FAR DA FAR
0.1 20 33.33 95 26.11 110 58.56 100 59.66

0.2 35 31.25 0 41.25 77.5 60.24 77.5 60.24
0.3 23.33 35.71 25 36.42 100 48.22 100 48.22
0.4 36.25 29.16 27.5 36.66 70 49.5 86.25 48.76
0.5 28 36 22 44 54 73.26 88 39.6
No.of nodes: 200 Table.1

Data Accurecy: In mean of mean is better then other methods.
Fault Alarm Ratio: In mean method FAR is comperatively less then the other
methods.
Work done till date

Noise Mean
n of n of
mean media
n
0.1 50 32.22 35 33.61 105 63.71 162.5 56.78

0.2 48.75 30.31 12.5 39.06 63.75 68.84 73.75 65.73
0.3 25 37.85 25.83 37.14 106.66 51.24 85.83 59.43
0.4 32.5 35 28.12 37.5 83.75 57.26 100 45.22
0.5 30 38 32 35.5 79.5 56.21 72 62.68
Table.2
No.of nodes: 400
Data Accurecy:mean of mean having better DA then other methods.
methods.
Work done till date

Noise Mean
Ratio median Mean Median
of of
mean median
0.1 51.33 31.66 40 32.96 76.66 66.54 50 69.13

0.2 39.44 31.42 23.33 36.25 65 68.19 22.5 78.37
0.3 34.44 33.57 34.44 33.33 110.55 49.16 111.66 48.21
0.4 28.33 37.5 27.91 37.5 80.41 59 97.5 47.09
0.5 27.33 40.33 22.66 44.66 58.66 76.41 67.33 67.1
No.of nodes: 600 Table.3
Data Accurecy:mean of mean having better DA then other methods.
methods.

Work done till date

Noise Mean
Ratio median Mean Median
of of
mean median
0.1 41.25 33.75 95 28.05 65 69.34 0 77.11

0.2 37.5 33.75 40.62 33.28 81.87 65.67 116.25 57.72
0.3 35.83 33.92 28.75 33.03 83.33 62.74 97.91 57.21
0.4 30.93 36.87 46.25 27.5 68.75 69.02 108.75 43.24
0.5 34 35 35.25 34.25 72.75 65.08 71.5 67.33
Table.4
No.of nodes: 800
Data Accurecy: mean of mean having better DA then other methods.
methods.

Work done till date

Noise Mean
n of n of
mean media
n
0.1 25 34.66 90 27.88 110 62.59 0 75.69

0.2 32.5 34 56.5 28.5 87 62.42 100 60.17
0.3 32.6 34.14 37.66 32.57 105.66 50.92 80 63.05
0.4 37.5 31.16 28.75 37.66 94.75 49.08 87.75 55.07
0.5 31 36.4 45.4 22.8 91.6 43.11 77 59.28
Table.5
No.of nodes: 1000
Data Accurecy: mean of mean having better DA then other methods.
methods.
Work done till date

Simulation of all different methods at a noise ratio 0.3 .
Graph.1 Graph.2
Graph.3 Graph.4
Outputs
Figure2[a] is ns-3 output of 6 number of nodes and their data

transmission.
Figure2[b] is showing the cluster head based data
transmission.
Fig.2(a) Fig.2(b)

[17]
Future Works
A deployment algorithm is generated using both coverage

and connectivity algorithm.
Simulation will show the effeciency of the algorithm.

[18]
Reference
[1] A fast fault tolerant Algorithm for wireless sensor Networks.

Dibakar Saha and Nabanita Das.
[2] Grid Coverage Algorithm & Analysis For Wireless Sensor Networks.
Ammar Hawbani, XingFu Wang,Naji Husaini and Saleem Karmoshi.
[3] Connectivity Algorithms. ~Abdol-Hossein Esfahanian

[19]
THANK YOU.

[20]

Pre Project Revised

Uploaded by

Copyright:

Available Formats

You might also like

Pre Project Revised

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Pre Project Revised

Uploaded by

Copyright:

Available Formats

B.

TECH PROJECT PRESENTATION 2018

Fault Tolerent Using Partioning Algorithm

Under the guidance of

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294)

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [2]

A random uniform distribution of sensor nodes on a 2-D plane, a fast self-

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [3]

Algorithm used cont.

6. Two random values t1 and t2 are generated using the rand()

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [5]

Algorithm used cont.

Fault Diagnosis cont.

Algorithm used cont.

5. Initially the Updated Fault Status (UFS) of the entered number

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [7]

Algorithm used cont.

Algorithm used cont.

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [9]

Object oriented language like c++,java

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [10]

Work done till date

0.1 20 33.33 95 26.11 110 58.56 100 59.66

No.of nodes: 200 Table.1

Work done till date

0.1 50 32.22 35 33.61 105 63.71 162.5 56.78

Work done till date

0.1 51.33 31.66 40 32.96 76.66 66.54 50 69.13

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [13]

Work done till date

0.1 41.25 33.75 95 28.05 65 69.34 0 77.11

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294) [14]

Work done till date

0.1 25 34.66 90 27.88 110 62.59 0 75.69

Work done till date

Simulation of all different methods at a noise ratio 0.3 .

Figure2[a] is ns-3 output of 6 number of nodes and their data

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294)

A deployment algorithm is generated using both coverage

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294)

[1] A fast fault tolerant Algorithm for wireless sensor Networks.

[3] Connectivity Algorithms. ~Abdol-Hossein Esfahanian

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294)

PRAJNYA PRAKASH ROUT(Roll:201410266) & SACHIN PRADHAN(Roll:201410294)

You might also like