Download - Weekly Updates -1.doc
-
8/10/2019 Weekly Updates -1.doc
1/14
SECURITY IN MOBILE AD-HOC NETWORKS
The Mobile Ad hoc Networks (MANETs) are most certainly a part of this
technological revolution. A MANET is a collection of wireless devices or nodes
that communicate by dispatching packets to one another or on behalf of another
devicenode! without having any central network authority or infrastructure
controlling data routing. MANET nodes have limitless connectivity and mobility to
other nodes routing! each node acts as a router and network manager to another
node
SECURITY IN MOBILE AD-HOC NETWORKS
The Mobile Ad hoc Networks (MANETs) are most certainly a part of this
technological revolution. A MANET is a collection of wireless devices or nodes
that communicate by dispatching packets to one another or on behalf of another
devicenode! without having any central network authority or infrastructure
controlling data routing. MANET nodes have limitless connectivity and mobility to
other nodes routing! each node acts as a router and network manager to another
node
SCOPE
"n this attempt! we describe and try to implement a method for preventing
wormhole attack called as #ormhole Attack $revention (#A$). All nodes monitor
its neighbor%s behavior when they send &&E' messages to the destination by using
a special list called Neighbor ist. #hen a source node receives some &&E$
messages! it can detect a route under wormhole attack among the routes. nce
wormhole node is detected! source node records them in the #ormhole Node ist.
Even though malicious nodes have been e*cluded from routing in the past! thenodes have a chance of attack once more. Therefore! we store the information of
wormhole nodes at the source node to prevent them taking part in routing again.
Moreover! the #A$ has the ability of detecting both the hidden and e*posed
attacks without special hardware.
-
8/10/2019 Weekly Updates -1.doc
2/14
+. ,etting up a simulation of Mobile Ad-hoc Network (MANET) implemented
using A-/0 N EMAN 1E0T& (A1) routing protocol.
2. "mplementing a #&M/E attack in the simulated MANET.
3. etection and prevention of #&M/E attack in the simulated MANET
using #&M/E ATTA04 $&E1ENT"N (#A$) algorithm.
The detection of wormholes in ad hoc networks is still considered to be a
challenging task. Thus! in attempt of implementation! we propose an algorithm to
detect and prevent wormholes using #A$ algorithm.
#e achieve this through the use of the neighbor node monitoring method of each
node and wormhole route detection method of the source node on the selectedroute. ur mechanism is implemented based on the A1 protocol and with the
help of simulation results we will try to infer the efficiency of the same.
-
8/10/2019 Weekly Updates -1.doc
3/14
,econd #eek
AODV Protocol
5 On-demand protocol, similar to DSR
5 Basic idea
6 Integrate DSDV(hop by hop) and DSR (on demand)
6 he ro!ting table only maintains the ro!ting in"ormation needed,
instead o" #eeping the entire ro!ting table (li#e DSR)
6 he ro!ting in"ormation is recorded into the ro!ting table o" the
intermediate ro!ter along the path, so the data pac#et only contains
the destination address (li#e DSDV)
5 $o phases%
6 Ro!te Disco&ery ' Ro!te aintenance
Ro!te Disco&ery
5 Ro!te disco&ery stage
6 hen the ro!te is needed, the so!rce sends the RR*+ pac#et in a
controlled ooding manner thro!gho!t the net$or#
6 Intermediate node chec#s its ro!ting table
5 I" $ith the ro!ting in"ormation, reply to destination $ith the
RR*P pac#et
5 other$ise, the intermediate "or$ards RR*+ pac#et to its
neighbors
6 inally, the destination or some intermediate nodes $ill reply the
ro!tes to the so!rce
-
8/10/2019 Weekly Updates -1.doc
4/14
-
8/10/2019 Weekly Updates -1.doc
5/14
Route Discovery
./ 0ode S needs a ro!te to D in order to send data pac#ets to D
./ 0ode S needs a ro!te to D in order to send data pac#et to D
1/ 2reates a Ro!te Re3!est (RR*+)
*nters D4s IP addr, se35,
S4s IP addr, se35
hopco!nt (67)
-
8/10/2019 Weekly Updates -1.doc
6/14
2reates a Ro!te Re3!est (RR*+)
*nters D4s IP addr, se35,
S4s IP addr, se35
hopco!nt (67)
8/ 0ode S broadcasts RR*+ to neighbors
0ode A recei&es RR*+
a#es re&erse ro!te entry "or S
dest 6 S, ne9thop 6 S, hopcnt 6 .
-
8/10/2019 Weekly Updates -1.doc
7/14
0ode A recei&es RR*+
a#es re&erse ro!te entry "or S
dest 6 S, ne9thop 6 S, hopcnt 6 .
It has no ro!te to D, so it rebroadcasts RR*+
/ 0ode 2 recei&es RR*+
a#es re&erse ro!te entry "or S
dest 6 S, ne9thop 6 A, hopcnt 6 1
It has a ro!te to D, and
the se35 "or ro!te "or D is :6D4s se35 in RR*+
-
8/10/2019 Weekly Updates -1.doc
8/14
0ode 2 sends RR*P
2 creates a Ro!te Reply (RR*P)
*nters D4s IP addr, se3 5
S4s IP addr, hopco!nt to D (6.)
;i"etime
-
8/10/2019 Weekly Updates -1.doc
9/14
3rdWeek
Route Maintenance
;in# bet$een 2 and D brea#s do$n
2 can per"orm local repair "or the ro!te to D
ethods to detect lin# brea#age
. =ello essage, RR*P $hose ; is one
1 ;1 rigger
;in# bet$een 2 and D brea#s do$n
2 can per"orm local repair "or the ro!te to D
1/ 0ode 2 in&alidates ro!te to D in ro!te table
-
8/10/2019 Weekly Updates -1.doc
10/14
>
/ 0ode 2 creates Ro!te *rror (R*RR) message
2 creates a Ro!te *rror (R*RR)
*nters Dest2o!nt (6.), D4s IP addr, se3 5
;ists all destinations $hich are no$ !nreachable
?Dest2o!nt@ eld indicates the n!mber o" !nreachabledestinations incl!ded in the R*RR message/
-
8/10/2019 Weekly Updates -1.doc
11/14
or$ards R*RR to S
0ode S recei&es R*RR
2hec#s $hether A is its ne9t hop on ro!te to D
Deletes ro!te to D
Redisco&ers ro!te i" still needed
-
8/10/2019 Weekly Updates -1.doc
12/14
4thWeek
AODV Message Formats
Route Request (RREQ) Message Format
Route Reply (RREP) Message Format
-
8/10/2019 Weekly Updates -1.doc
13/14
Route Error (RERR) Message Format
-
8/10/2019 Weekly Updates -1.doc
14/14
thand Cthee# e9plain or# hole attraction algorithm