You are on page 1of 14

Secure source Routing and Packet Forwarding

in Manets
I am going to implement a new manet routing
protocol SRPF.
I undertook the implementing of this protocol
after discovering vulnerabilities in Source
Routing
For implementing I am using 2 languages
C++
TCL
2 requirements of the simulator
Detailed simulation of Protocol: Run-time
speed;
Varying parameters or configuration: easy
to use.
C++ is fast to run but slower to code and
change;
OTcl is easy to code but runs slowly.
1. SRPF.H
This s the header file where will be all necessary timers and routing
which performs protocol functionality.
2. SRPF.cc
. In this file implemented all timers functions and Tcl hooks.
. The aim is to let SRPF to be instantiated from Tcl.
3. SRPF PACKET.H
Here are declared all packets SRPF protocol needs exchange
among nodes in the manet (REQUEST, REPLY, ERROR).


Source S floods all nodes with Path Request Packets
(PREQ) to discover destination D
[3]
[3,1,8,11]
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
[3,1]
[3,1,6]
[3,1,8]
Route reply packet (PREP) is sent back to source along
reversed loose source route of nodes.
Each node along the way incrementally compute a hop-
by-hop strict source route.
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
the reversed
loose source route of
PREP: [11,8,1,3]
[11]
[11,9]
[11,9,4]
[11,9,4,3]
the computed
strict source route of
3->11 is: [11,9,4,3]
[11,9,4]
Route reply packet (PREP) is sent back to source along
reversed loose source route of nodes.
Each node along the way incrementally compute a hop-
by-hop strict source route.
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
the reversed
loose source route of
PREP: [11,8,1,3]
the computed
strict source route of
3->11 is: [11,9,4,3]
Use source routing for actual packet forwarding
A forwarding node sends a path Error Message (ERR) to
packet source if the next hop in source route is
unreachable
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
Source route header of data
packet: [3,4,9,11]
Path error (ERR)
down link: {9->11}
Objective
Increase Packet Delivery Ratio
Save Route Rediscovery flooding traffic
Reduce overall route acquisition delay
Mechanism
Spatial Locality
A forwarding node repairs a broken route using its 2-hop-
topology information and modifies source route header
accordingly.
Destination node sends a gratuitous route reply to inform source
of the modified route
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
Source route header of data
packet: [3,4,9,11]
Route error (ERR)
down link: {9->11}
A forwarding node repairs a broken route using its 2-hop-
topology information and modifies source route header
accordingly.
Destination node sends a gratuitous route reply to inform source
of the modified route
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
Source route header of data
packet: [3,4,9,11]
Modified source route
[3,4,9,8,11]
A forwarding node repairs a broken route using its 2-hop-
topology information and modifies source route header
accordingly.
Destination node sends a gratuitous route reply to inform source
of the modified route
1
2
4
5
6
7
8
9
10
3
11
3 (S)
11 (D)
Source route header of data
packet: [3,4,9,11]
Gratuitous route reply
[3,4,9,8,11]
SRPF is a robust/scalable routing protocol
superior to the existing proposals
Surely I believe that I will succeed my task in
future. I need all your support to carry my
work in future.

You might also like