REDUCTION OF PARTIAL UNWANTED DATA USING DAA PROTOCOL IN WSN

under the guidance of Mr. A. MallaReddy Asst.Professor. Dept. of ECE

by Vijay kumar Mendu 09621D6123 M.Tech (Communication Systems)

PROBLEM DEFINITION
In wireless sensor network , data transferring from one node to another node there may be chances of arising some unwanted data Existing technique if unwanted data is found the aggregator forwards the data to the other nodes and dont allow any changes on the data by aggregator

Problem solution
Data aggregation and authentication protocol By using this the data can be forwarded with authentication

DAA
Data aggregation and authentication it reduces data redundancy it provides data accuracy it improves the life time of battery it improves the utilization of bandwidth

SENSOR NODE DEPLOYMENT

DATA AGGREGATION BETWEEN SENSOR NODES

Figure: Data transfer between node and base station

DAA CONTAINS 3 STEPS

Monitor node selection Forming pair of nodes Integrity of security and reduction of unwanted data

PROCESS FLOW

CREATION OF NODES

CREATION OF NETORK

SELECTION OF AGGREGATOR

SELECTION OF NEIGHBOR NODES

DATA IS FORWARDED IN ENCRYTED MANNER

FORMING PAIR OF NODES

SELECTION OF MONITOR NODES

Creation of nodes
Creating sensor nodes randomly and assigning id to every node Let us consider no of nodes as n= 16

ID

x-axis

Y-axis

z-axis

KEYS

1 2 3 4 5

6 3 16 11 7

16 6 14 12 1

80 20 30 130 10

7 6 12 14 3

6
7 8 9 10 11 12 13 14

14
8 5 15 1 2 4 13 9

13
5 9 15 11 10 3 7 2

60
100 90 150 140 160 50 110 120

10
8 15 11 5 4 16 1 13

15
16

10
12

8
4

40
70

2
9

Creation of network
Connection is established between every node Calculating distance between each node Ex: 0 10 10 6 15 9 11 7 9 7 7 13 10 0 15 10 6 13 5 4 15 5 4 3

ID

x-axis

Y-axis

z-axis

KEYS

DISTANCE

1 2 3 4

6 3 16 11

16 6 14 12

80 20 30 130

7 6 12 14

0 10 10 6

5
6 7 8 9 10 11 12 13 14 15 16

7
14 8 5 15 1 2 4 13 9 10 12

1
13 5 9 15 11 10 3 7 2 8 4

10
60 100 90 150 140 160 50 110 120 40 70

3
10 8 15 11 5 4 16 1 13 2 9

15
9 11 7 9 7 7 13 11 14 9 13

Selection of aggregator
In this case each node can act as aggregator To be act as current aggregator It should contain backward and forward aggregator

Aggregator table

ID

x-axis

Y-axis

z-axis

KEYS

DISTANCE

GROUPS

GROUP NO

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

6 3 16 11 7 14 8 5 15 1 2 4 13 9 10 12

16 6 14 12 1 13 5 9 15 11 10 3 7 2 8 4

80 20 30 130 10 60 100 90 150 140 160 50 110 120 40 70

7 6 12 14 3 10 8 15 11 5 4 16 1 13 2 9

0 10 10 6 15 9 11 7 9 7 7 13 11 14 9 13

0 6 7 7 7 9 9 9 10 10 11 11 13 13 14 15 G3 G3 G3 G3 G2 G2 G2 G2 G1 G1 G1 G1

Generation of MACs
data aggregators are allowed to encrypt and decrypt the aggregated data.

The forwarding nodes first verify data integrity using MACs and then relay the data if it is not false.
An FMAC consists of small-size MACs, called subMACs, such that one of them is computed by a data aggregator and the remaining subMACs are computed by its monitoring nodes. sensor node has the same pseudo-random number generator (PRNG) that generates random numbers ranging from 1 to 32. After the pairs are formed and their shared keys are established, the sensor nodes of each pair initiate their PRNGs using their shared key as the seed.

Pairwise Key Establishment and Sybil Attacks

Monitoring node can establish a pairwise shared key with its pairmate that is multiple hops away.

By using random key distribution protocols, monitoring nodes can ensure the identity of their pairmates, there by preventing Sybil attacks where a compromised node fakes multiple identities to establish pair relations with more than one monitoring node.

Group Key Establishment

Each data aggregator and its neighboring nodes are assumed to establish a group key, called , using an existing group key establishment scheme.

Monitor node selection

Monitor node selection process

Monitor node selection

Monitor nodes are selected from neighbor nodes for data verification We have to assign some indices to neighbor nodes to act as monitor nodes Data aggregator requests the neighbor node to send its random numbers using PRNG and key it shares with data aggregator When data aggregator receives random no's and node IDs and it give labeling to it All random numbers are sort in ascending order and computes MAC for random numbers and broadcast to the neighbor nodes Each node verifies the broadcast no's by checking whether two random no's it sent earlier match two random numbers hence verification is successful else sit sends the request.

To determine indices for monitoring nodes we use the formula as below

General architecture used by DAA

Forming pair of nodes

 The monitor node of current aggregator should link with any node that act as forwading node The monitor node of current aggregator can link with any neighbor node of forward aggregator

Integration of secure da and false data detection

Let Au denote the current data aggregator Each Ni of those

Simulations are performed using DDAA and Dtradauth equations.

Ltos length of data packet Hd= data aggregator ---data packet generate by legitimate node ---unwanted data packet injected by T compromised node H =21 and Ltos =41 the results are obtained

SCOPE OF PROJECT
Reduction of partial unwanted data using DAA protocol Reducing the no of monitoring nodes Computation should be fast