Information Technology Reference
In-Depth Information
routing protocol for WSN. Whenever the neighbour table is checked to select the
optimal node, the neighbouring node behaviour is monitored in the routing
management. As soon as the abnormal behaviour is detected, the information is passed
to security management module. The security module then matches the neighbouring
node characteristics with the given threshold. If any neighbouring node mismatches, the
security module classifies it as non-self and remove entry from neighbour table.
The flow of the system is elaborated with the help of flowchart as shown in Figure 2.
Whenever routing management module wants to select the next best node, the
monitoring agent checks the behaviour of neighbouring nodes. First, the numbers of
records are counted in neighbour table. If no record is found the checking process is
deferred until the neighbours are discovered. Otherwise, the behaviour checking
continues with the initialization of variables as shown in Table 1.
After initialization the correlation coefficient function is called which determines
the relationship difference between x and y arrays. The correlation coefficient is a
statistical function as shown by Equation 1 to calculate the relation between two
groups of same entity. The statistical matching rule produces a number between -1
and 1 that relates how similar the two input sequences are.
∑
∑
∑
x, y
ϵ
{0...255}
N
,
N
=
l
/8,
[10]
(1)
If the relation is having less or equal difference according to the given error rate, the
process jumps to the selection criteria. Else, if the variation goes beyond detection
agent is called to thoroughly check entry-by-entry in the current neighbour table. In the
inspection, if any neighbouring nodes characteristics exceed the given threshold, the
particular neighbour node is categorized as non-self by the decision agent. The
decision based on the Equation 2 to classify node as self or non-self. After
classification, the defence agent removes the non-self neighbouring nodes from the
neighbouring table. Onwards ACO based routing procedure continues with
p
k
ij
(t) as
explained in [6].
match (ƒ,
Ɛ
,I,D) =
,
ƒ
,1
,
[10]
(2)
where, I = Input string, D = Decision Agent's matching String, f = Matching Function,
Ɛ
= Matching Threshold.
Table 1.
Security Parameters
Packet
Receiving Rate
Packet
Mismatch Rate
Packet
Receiving Rate
Energy
Sink hole attack
[15]
To make
relationship with
Message alter
attack[15]
To make
relationship with
Tackled Attacks
x
1
1
x
1
2
.
.
.
.
x
1
n
y
1
1
y
1
2
.
.
.
.
y
1
n
x
2
1
x
2
2
.
.
.
.
x
2
n
y
2
1
y
2
2
.
.
.
.
y
2
n
Node 1
Node 2
.
.
.
.
Node n
Search WWH ::
Custom Search