1. Dissertation Seminar
0n
Implementation of Sinkhole
Attack in DSR Protocol In MANET
By
Miss.Anuprita P. Gawande
Under The Guidance Of
Prof.Dr.D.J.Pethe
3. Introduction :
What is Ad Hoc Network?
•In Latin, ad hoc means "for this," further
meaning "for this purpose only.”
•All nodes are mobile and can be connected
dynamically in an arbitrary manner.
•No default router available.
•Potentially every node becomes a router: must
be able to forward traffic on behalf of others.
4. Working Of Ad-hoc Network:-
Start
Nodes send signal to find the number of other nodes within range
Synchronizing between nodes
Sender node send messages to receiving node
receiving node ready
Communication begins
Termination Process
Stop
Receiving node
Send back
Ready signal
Is Wait for
sometime
Yes No
5. What is mean by Mobile Ad-hoc Network?
Mobile Ad-hoc Network is a collection of
independent mobile nodes that can communicate to
each other via radio waves.
6. • Host movement frequent
• Topology change frequent
A
B
A
B
• No cellular infrastructure. Multi-hop wireless links
• Data must be routed via intermediate nodes
7. MANET
• Do not need backbone infrastructure support
• Are easy to deploy
• Useful when infrastructure is absent,
destroyed or impractical
• Infrastructure may not be present in a disaster
area or war zone
8. Where MANETs are used?
• For military and rescue use.
• Information distribution for
meetings, seminars etc.
• Internet / intranet hot spots in
public transportation.
• Localized advertising and shopping.
• New mobile devices are invented
constantly and used various ways.
11. Behavior Based Attack in MANET:-
• Passive Attack
• Active Attack
• Location Based Attack
• Denial Of Service
• Impersonation
• Eavesdropping
• Sybil Attack
12. Why traditional routing protocols are
not suitable for MANETs?
• No pre-existing infrastructure.
• No centralized administration.
• Dynamic topologies.
• Variable capacity links.
• Energy-constrained nodes.
• Limited physical security.
14. MANET Routing Protocols
• Reactive Protocols
– Determine route if and when needed
– Example: DSR (dynamic source routing)
• Proactive Protocols
– Traditional distributed shortest-path protocols
– Example: DSDV (destination sequenced distance
vector)
• Hybrid Protocols
– Adaptive; Combination of proactive and reactive
– Example : ZRP (zone routing protocol)
15. Dynamic Source Routing (DSR):
Source S initiates a route discovery by flooding Route
Request (RREQ)
Each node appends its own identifier when
forwarding RREQ
Destination D on receiving the first RREQ, sends a
Route Reply (RREP)
RREP sent on route obtained by reversing the route
appended in RREQ
RREP includes the route from S to D, on which RREQ
was received by D
S routes data using “source route” mechanism
16. B
A
S E
F
H
J
M
D
C
G
I
K
Z
Y
N
Represents a node that has received RREQ for D from S
L
17. B
A
S E
F
H
J
D
C
G
I
K
Represents transmission of RREQ
Z
Y
Broadcast transmission
M
N
L
[S]
[X,Y] Represents list of identifiers appended to RREQ
18. B
A
S E
F
H
J
M
D
C
G
I
K
Z
Y
• Node H receives packet RREQ from two neighbors:
potential for collision
N
L
[S,E]
[S,C]
19. B
A
S E
F
H
J
Z
M
D
C
G
I
K
Y
N
• Node C receives RREQ from G and H, but does not forward
it again, because node C has already forwarded RREQ once
L
[S,C,G]
[S,E,F]
20. B
A
S E
F
H
[S,E,F,J]
J
D
C
G
I
K
Z
Y
M
• Nodes J and K both broadcast RREQ to node D
• Since nodes J and K are hidden from each other, their
transmissions may collide
N
L
[S,C,G,K]
21. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
• Node D does not forward RREQ, because node D
is the intended target of the route discovery
M
N
L
[S,E,F,J,M]
22. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
RREP [S,E,F,J,D]
Represents RREP control message
23. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
DATA [S,E,F,J,D]
Packet header size grows with route length
24. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
RERR [J-D]
J sends a route error to S along route J-F-E-S when its
attempt to forward the data packet S (with route SEFJD) on
J-D fails
25. Each node caches a new route it learns by any
means
When node S finds route [S,E,F,J,D] to node D,
node S also learns route [S,E,F] to node F
When node K receives Route Request [S,C,G]
destined for node, node K learns route
[K,G,C,S] to node S
26. When node F forwards Route Reply RREP
[S,E,F,J,D], node F learns route [F,J,D] to node D
When node E forwards Data [S,E,F,J,D] it learns
route [E,F,J,D] to node D
A node may also overhear Data to learn routes
27. B
A
S E
[F,J,D],[F,E,S]
F
H
J
D
C
G
I
K
Z
M
N
L
[S,E,F,J,D]
[E,F,J,D]
[C,S]
[G,C,S]
[J,F,E,S]
[K,G,C,S]
RREQ
When Z sends a route request for C, node K
sends back a route reply [Z,K,G,C] to Z using
a locally cached route
RREP
28. Uses:
Finding alternate routes in case original route breaks
Route reply from intermediate nodes
Problems:
Cached routes may become invalid over time and due
to host mobility
Stale caches can adversely affect performance
29. Routes maintained only between nodes who
need to communicate
reduces overhead of route maintenance
Route caching can further reduce route
discovery overhead
A single route discovery may yield many routes to
the destination, due to intermediate nodes replying
from local caches
30. Packet header size grows with route length due
to source routing
Flood of route requests may potentially reach all
nodes in the network
An intermediate node may send Route Reply
using a stale cached route, thus polluting other
caches
31. Analysis Of Problem:
• MANET nodes are free to move randomly and organize
themselves arbitrarily, thus the topology may change rapidly and
unpredictably.
•Because of its dynamic network topology, it is exposed to
various network attacks including eavesdropping, selfish nodes,
data tampering, network congestion etc.
•When a malicious which can modify the network routing
packets or generate enormous Artificial traffics takes part in the
MANET, it makes network delay, energy consumption, finally
makes the network disabled.
• MANET routing protocols (AODV, DSR) are vulnerable to the
attacks like Sinkhole attack, blackhole attack.
10/12/2014 31
32. Sinkhole Attack:
•Sinkhole attack tries to attract the data to itself from
all neighboring nodes.
•It generates the fake routing information.
10/12/2014 Generation Of Bogus RREQ 32
33. •Sinkhole node attempts to draw all network traffic to itself. Thereafter it alters the
data packet or drops the packet silently. Sinkhole attack increases network
overhead, decreases network's life time by boosting energy consumption, finally
destroy the network.
•Shows the generation of the bogus RREQ packet. Sinkhole node 2 make the
bogus RREQ which looks as if it is originated by node 0. Sequence number of
bogus packet is 999, much higher than original source's, 6.
10/12/2014 Bogus RREP propagation 33
34. Impact of Sinkhole Attack On Ad-hoc Network:
•When there the sinkhole attack occur in Ad-hoc
network performance of ad-hoc network get
decreases.
•It decreases
•Packet Delivery Ratio.
•End to end delay
•Packet loss Ratio.
10/12/2014 34
35. System Analysis:-
What is ns-2?
ns-2 stands for Network Simulator version 2.
• ns-2: Is a discrete event simulator for networking
research
• Work at packet level.
• Provide substantial support to simulate bunch of
protocols like TCP, UDP, FTP, HTTP and DSR.
• Simulate wired and wireless network.
• Is primarily Unix based.
• Use TCL as its scripting language.
• ns-2 is a standard experiment environment in
research community.
10/12/2014 35