A Novel Approach To Defend and Detect Flood Attacks in Disruption Tolerant Networks
A Novel Approach To Defend and Detect Flood Attacks in Disruption Tolerant Networks
A Novel Approach To Defend and Detect Flood Attacks in Disruption Tolerant Networks
________________________________________________________________________________________________
III. OVERVIEW
A. Defining the problem
Nodes in DTNs frequently come across the following
two attacks. The first one is the packet flood attacks and
the second one is replica flood attacks. Let us consider
about how we are dealing with these two kinds of
attacks.
B. Defending against flood attacks
Consider that a node sends packets with some limit L at
each time interval T. If the node generates the packets
by adhering to its limits, then the node is considered as a
legitimate node. If the node exceeds its fixed limit, then
the packets are considered as the flooded packets in the
network.
C. Defending against replica attacks
Consider that a node is sending the packets to another
node in the network. Now, if the packets are sent within
the limit, and with unique packets, then there would not
be any problem. But if the source node intentionally
replicates the same packet several times and send them
into the network, then it can be identified as an attacker.
3: compress packets
________________________________________________________________________________________________
ISSN (Online): 2347 - 2812, Volume-2, Issue -11,12 2014
15
12:
13: end if
14: if detects consistency then
15:
accept packet
16:
17: end if
18: end if
V. PERFORMANCE EVALUATION
A. Setting up the environment
To evaluate our scheme, we simulate the network with
an initial number of nodes, and we intentionally deploy
the attacker nodes into the network. We also decide the
parameter k which is a system parameter. After some
time, the system is capable of finding the intentionally
deployed attacker and thus, we are successful in
identifying the attacker.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
W. Gao, Q. Li, B. Zhao, and G. Cao,
Detection rate: can be calculated as the total number of
Multicasting in Delay Tolerant Networks: A
attackers that are identified out of all the available
attackers.
________________________________________________________________________________________________
ISSN (Online): 2347 - 2812, Volume-2, Issue -11,12 2014
16
[10]
[11]
[12]
[13]
[14]
________________________________________________________________________________________________
ISSN (Online): 2347 - 2812, Volume-2, Issue -11,12 2014
17