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
device/node, 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
device/node, 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
In this attempt, we describe and try to implement a method for preventing
wormhole attack called as Wormhole Attack Prevention (WAP). All nodes monitor
its neighbors behavior when they send RREQ messages to the destination by using
a special list called Neighbor List. When a source node receives some RREP
messages, it can detect a route under wormhole attack among the routes. Once
wormhole node is detected, source node records them in the Wormhole Node List.
Even though malicious nodes have been excluded from routing in the past, the
nodes 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 WAP has the ability of detecting both the hidden and exposed
attacks without special hardware.

1. Setting up a simulation of Mobile Ad-hoc Network (MANET) implemented

using AD-HOC ON DEMAND VECTOR (AODV) routing protocol.
2. Implementing a WORMHOLE attack in the simulated MANET.
3. Detection and prevention of WORMHOLE attack in the simulated MANET
using WORMHOLE ATTACK PREVENTION (WAP) 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 WAP algorithm.
We 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 selected
route. Our mechanism is implemented based on the AODV protocol and with the
help of simulation results we will try to infer the efficiency of the same.

Second Week
AODV Protocol

On-demand protocol, similar to DSR

Basic idea

Integrate DSDV(hop by hop) and DSR (on demand)

The routing table only maintains the routing information needed,

instead of keeping the entire routing table (like DSR)

The routing information is recorded into the routing table of the

intermediate router along the path, so the data packet only contains
the destination address (like DSDV)

Two phases:

Route Discovery & Route Maintenance

Route Discovery

Route discovery stage

When the route is needed, the source sends the RREQ packet in a
controlled flooding manner throughout the network

Intermediate node checks its routing table

If with the routing information, reply to destination with the

RREP packet

otherwise, the intermediate forwards RREQ packet to its

neighbors

Finally, the destination or some intermediate nodes will reply the

routes to the source

Route Discovery

1. Node S needs a route to D in order to send data packets to D

1. Node S needs a route to D in order to send data packet to D

2. Creates a Route Request (RREQ)
Enters Ds IP addr, seq#,
Ss IP addr, seq#
hopcount (=0)

Creates a Route Request (RREQ)

Enters Ds IP addr, seq#,
Ss IP addr, seq#
hopcount (=0)
3. Node S broadcasts RREQ to neighbors

Node A receives RREQ

Makes reverse route entry for S
dest = S, nexthop = S, hopcnt = 1

Node A receives RREQ

Makes reverse route entry for S
dest = S, nexthop = S, hopcnt = 1
It has no route to D, so it rebroadcasts RREQ

. Node C receives RREQ

Makes reverse route entry for S
dest = S, nexthop = A, hopcnt = 2
It has a route to D, and
the seq# for route for D is >=Ds seq# in RREQ

Node C sends RREP

C creates a Route Reply (RREP)
Enters Ds IP addr, seq #
Ss IP addr, hopcount to D (=1)
Lifetime
Unicasts RREP towards A
C can allow D to set up a path towards S with
Gratuitous RREP.

Node A receives RREP

Makes forward route entry to D
dest = D, nexthop = C, hopcount = 2, Lifetime
Unicasts RREP to S

Node S receives RREP

Makes forward route entry to D
dest = D, nexthop = C, hopcount = 3, Lifetime

3rd Week
Route Maintenance

Link between C and D breaks down

C can perform local repair for the route to D
Methods to detect link breakage
1

Hello Message, RREP whose TTL is one

L2 Trigger

Link between C and D breaks down

C can perform local repair for the route to D
2. Node C invalidates route to D in route table

\
. Node C creates Route Error (RERR) message
C creates a Route Error (RERR)
Enters DestCount (=1), Ds IP addr, seq #
Lists all destinations which are now unreachable
DestCount field indicates the number of unreachable
destinations included in the RERR message.
Unicasts RERR to upstream neighbors in precursor list

Node A receives RERR

Checks whether C is its next hop on route to D
Deletes route to D
or invalidates the route to D according to N flag
(No delete flag)
When N flag is set, A does not send RERR to S and may reinitiate
route discovery for D.

Forwards RERR to S

Node S receives RERR

Checks whether A is its next hop on route to D
Deletes route to D
Rediscovers route if still needed

4th Week
AODV Message Formats
Route Request (RREQ) Message Format

Route Reply (RREP) Message Format

Route Error (RERR) Message Format

5th and 6th Week explain Work hole attraction algorithm