Presentation Content

Course title: Wireless

Topic: OLSR, DSDV, ZPR

Submitted to: Mr.Zeeshan

Submitted by: Fiza Anwar # 042

Amina Rehman # 076

Samreen Javed #052

Department: BS_INFORMATION TECHNOLOGY 5th

1. Optimized Link State Routing Protocol
OLSR is Proactive protocol and Table driven protocol. Each node selects a set of its
neighbor nodes, these known as “MPR”. Only MPR can transmit, other nodes can’t retransmit or
rebroadcast.

I. Proactive algorithms:
Maintain routes to destinations even if they are not needed. Some
of the examples are Destination Sequenced Distance Vector (DSDV), Wireless Routing
Algorithm (WRP), Global State Routing (GSR), Source-tree Adaptive Routing (STAR),
Cluster-Head Gateway Switch Routing (CGSR), Topology Broadcast Reverse Path
Forwarding (TBRPF), Optimized Link State Routing (OLSR) etc.
 Always maintain routes:- Little or no delay for route determination
 Consume bandwidth to keep routes up-to-date
 Maintain routes which may never be used
 Advantages: low route latency, State information, QoS guarantee related to
connection set-up or other real-time requirements
 Disadvantages: high overhead (periodic updates) and route repair depends
on update frequency

II. OLSR- Types of Packets

1: Hello packets
2: Topology control packet

1: Hello packets
Each node periodically broadcast its Hello message. It contain list of addresses of
neighbors which heard by node and which heard by neighbor nodes. Each node
constructs its MPR selector table.

2: Topology control packet

Message might not be send if there are no updates. Each node maintains a topology table
based on TCP. It contain

 MPR selector
 Sequence number

III. MPR selection Algorithm

 Each point u has to select its set of MPR.
 Select in the 1-neighborhoof of u which is (N1 (u)) a set of nodes as small as possible
which covers the whole 2-neighborhood of u which is (N2 (u)).
  Step1: Select nodes of N1 (u) which cover isolated points of N2 (u).
 Step2: Select among the nodes of N1 (u) not selected at the first step, the node which
covers the highest number of points
of N2 (u) and go on till every
points of N2 (u) are covered.
IV. Neighbor table
 Each node records the information
about its on hop neighbor and a list
of two hop neighbors.
 Contain a sequence number value
which specifies the most recent
MPR set.
 Every time updates its MPR set, the
sequence number is incremental.
V. OLSR Routing Table
 Routing table is based on the information contained in the neighbor table and the
topology table.
 Routing table:
 Destination address
 Next hop address
 Distance
Routing table is recalculated after every change in neighbor table or in topology table.

2. DESTINATION SEQUENCED DISTANCE VECTOR (DSDV)

DSDV was one of the first proactive routing protocols available for Ad Hoc networks. It
was developed by C. Perkins in 1994. 5 years before the informational RFC of the MANET group.
It has not been standardized by any regulation authorities but is still useful.

i. DSDV Algorithm
DSDV is based on the Bellman-Ford algorithm.

Steps for algorithm

1) Each routing table will contain all available destinations, with the associated next
hope and a sequence number.
2) Tables are updated in the topology per exchange between nodes.
3) Each node will broadcast to its neighbors entries in its table.
4) Nodes who receive this data can update their tables when they received a better route,
or a new one.
5) It contains incremental updates which will cause less traffic.
Illustration: This algorithm will illustrated by this example:
 At t=0, the network is organized as shows figure 1. We suppose at this time the network is
stable, each node has a correct routing table of all destinations. Then, we suppose G is moving,
and at t+1, the topology is as shown in figure 2.

ii. Advantages
 DSDV was one of the early algorithms available.
 It is quite suitable for creating ad hoc networks with small number of nodes.
 DSDV guarantees for loop free path.
iii. Disadvantages
 DSDV requires a regular update of its routing tables, which uses up battery power
and a small amount of bandwidth even when the network is idle.
 Whenever the topology of the network changes, a new sequence number is necessary
before the network re-converges; thus, DSDV is not suitable for highly dynamic
networks

3. Zone Routing protocol

This is also a hybrid routing protocol used in proactive and Reactive both Routing
protocol. In an ad-hoc network, it can be assumed that the largest part of the traffic is directed
to nearby nodes. Therefore, ZRP reduces the proactive scope to a zone centered on each
node. In a limited zone, the maintenance of routing information is easier.

i. Types of Routing
Proactive:

 Start working in Advance.

 For every node Route Immediately Available.
Reactive:

 On demand.
 Route Delayed Availability.
ii. Working of Zone Routing Protocol
If a packet's destination is in the same zone as the origin, the proactive protocol using
an already stored routing table is used to deliver the packet immediately.
If the route extends outside the packet's originating zone, a reactive protocol takes over to
check each successive zone in the route to see whether the destination is inside that zone.
This reduces the processing overhead for those routes. Once a zone is confirmed as
containing the destination node, the proactive protocol, or stored route-listing table, is used to
deliver the packet.
In this way packets with destinations within the same zone as the originating zone are
delivered immediately using a stored routing table. Packets delivered to nodes outside the
sending zone avoid the overhead of checking routing tables along the way by using the
reactive protocol to check whether each zone encountered contains the destination node.
iii. Detailed
What is called the Intra-zone Routing Protocol (IARP), or a proactive routing
protocol, is used inside routing zones. What is called the Inter-zone Routing Protocol
(IERP), or a reactive routing protocol, is used between routing zones. IARP uses a
routing table. Since this table is already stored, this is considered a proactive protocol.
IERP uses a reactive protocol. Any route to a destination that is within the same local
zone is quickly established from the sources proactively cached routing table by IARP.
Therefore, if the source and destination of a packet are in the same zone, the packet can
be delivered immediately.

iv. Most existing proactive routing algorithms can be used as the IARP for
ZRP.
In ZRP a zone is defined around each node, called the node's k-neighborhood, which
consists of all nodes within k hops of the node. Border nodes are nodes which are exactly
k hops away from a source node.

v. Architecture
The Zone Routing Protocol, as its name implies, is based on the concept of zones. A
routing zone is defined for each node separately, and the zones of neighboring nodes
overlap.

H
G C
B
A D
S

F E I K
J

 Peripheral nodes are nodes whose minimum distance to the central node is exactly equal
to the zone.
 The nodes whose minimum distance is less than are interior nodes.

Example
Consider the network in Figure. The node S has a packet to send to node X. The
zone radius is ρ=2. The node uses the routing table provided by IARP to check whether
the destination is within its zone. Since it is not found, a route request is issued using
IERP. The request is border cast to the peripheral nodes (gray in the picture).
 H
G C
B
A D U X
S
K
F E T W
J I L
N V
P
Q O
R

Node I do not find the destination in its routing table. Consequently, it broadcasts
the request to its peripheral nodes, shown in gray in Figure 4. Due to query control
mechanisms, the request is not passed back to nodes D, F and S.
H
G C
B
A D U
S X
K
F E T W
J I L

N V
P
Q O
R

Finally, the route request is received by node T, which can find the destination in
its routing zone, shown in Figure 5. Node T appends the path from itself to node X to the
path in the route request. A route reply, containing the reversed path is generated and sent
back to the source node. If multiple paths to the destination were available, the source
would receive several replies.
H

G
C
B

D
A U X
S
K
F E T
W
J L
I

N V
P
O
Q
R