Optimized Link State Routing Protocol

for Ad Hoc Networks

Jacquet, p
IEEE INMIC Dec. 2001
park gi won
2004.06.18

1
contents
Introduction
Reactive versus Proactive routing approach
OLSR (Optimized Link State Routing) Protocol
Protocol functioning
Conclusions

2
Introduction

Routing Protocol for

MANET

Table-Driven/ Hybrid On-Demand- Clusterbased/

Proactive driven/Reactive Hierarchical

Distance Link- ZRP DSR LANMAR

Vector State AODV CEDAR
TORA
DSDV OLSR
TBRPF MANET: Mobile Ad hoc Network
FSR
(IETF working group)
STAR

3
Reactive versus Proactive routing approach
Proactive Routing Protocols
Periodec exchange of control messages
+ immediately provide the required routes when needed
- Larger signalling traffic and power consumption.

Reactive Routing Protocols

Attempts to discover routes only on-demand by flooding
+ Smaller signalling traffic and power consumption.
- A long delay for application when no route to the destination
available

4
OLSR - Overview
OLSR
Inherits Stability of Link-state protocol
Selective Flooding
only MPR retransmit control messages:
Minimize flooding
Suitable for large and dense networks

5
OLSR Multipoint relays (MPRs)
MPRs = Set of selected neighbor nodes
Minimize the flooding of broadcast packets
Each node selects its MPRs among its on hop neighbors
The set covers all the nodes that are two hops away

MPR Selector = a node which has selected node as MPR

The information required to calculate the multipoint relays :
The set of one-hop neighbors and the two-hop neighbors

Set of MPRs is able to transmit to all two-hop neighbors

Link between node and its MPR is bidirectional.

6
OLSR Multipoint relays (cont.)
To obtain the information about one-hop neighbors :
Use HELLO message (received by all one-hop neighbors)

To obtain the information about two-hop neighbors :

Each node attaches the list of its own neighbors

Once a node has its one and two-hop neighbor sets :

Can select a MPRs which covers all its two-hop neighbors

7
OLSR Multipoint relays (cont.)

MPR(Retransmission
node)

4 retransmission to diffuse a
message up to 2 hops

Figure 1. Diffusion of a broadcast message using multipoint relays

8
OLSR Multipoint relays (cont.)
Node 1 Hop Neighbors 2 Hop Neighbors MPR(s)
B A,C,F,G D,E C

E
D

F
A

Figure 2. Network example for MPR selection

9
OLSR Multipoint relays (cont.)

E F H

MS(A) = {B,H,I}

D C B A I

MS(C) = {B,D,E} MPR(B) = {A,C}

Figure 3. MPR MPR Selector Set

10
Protocol functioning Neighbor sensing
Each node periodically broadcasts its HELLO messages:
Containing the information about its neighbors and their link
status
Hello messages are received by all one-hop neighbors

HELLO message contains:

List of addresses of the neighbors to which there exists a valid
bi-directional link
List of addresses of the neighbors which are heard by node( a
HELLO has been received )
But link is not yet validated as bi-directional

11
Protocol functioning Neighbor sensing (cont.)

Message type Vtime Message size

Originator Address
Time To Live Hop count Message Sequence Number
Reserved Htime Willingness
Link code Reserved Link message size
Neighbor Interface Address
Neighbor interface Address

Reserved Htime Willingness
Link code Reserved Link message size
Neighbor interface address
Neighbor interface address

Link type Neighbor type

Table 1. Hello Message Format in OLSR

12
Protocol functioning Neighbor sensing (cont.)

HELLO messages :
Serves Link sensing
Permit each node to learn the knowledge of its neighbors up
to two-hops (neighbor detection)
On the basis of this information, each node performs the
selection of its multipoint relays (MPR selection signaling)
Indicate selected multipoint relays

On the reception of HELLO message:

Each node constructs its MPR Selector table

13
Protocol functioning Neighbor sensing ( cont.)

In the neighbor table:

Each node records the information about its on hop neighbor
and a list of two hop neighbors
Entry in the neighbor table has an holding time
Upon expiry of holding time, removed
Contains a sequence number value which specifies the most
recent MPR set
Every time updates its MPR set, this sequence number is
incremented

14
Protocol functioning Neighbor sensing
Example of neighbor table
One-hop neighbors Two-hop neighbors
Neighbors id State of Link Neighbors id Access though

B Bidirectional E C
G Unidirectional D C

C MPR

Table 2. Example of neighbor table

15
Protocol functioning Multipoint relay selection

Each node selects own set of multipoint relays

Multipoint relays are declared in the transmitted
HELLO messages
Multipoint relay set is re-calculated when:
A change in the neighborhood( neighbor is failed or add new
neighbor )
A change in the two-hop neighbor set

Each node also construct its MPR Selector table with

information obtained from the HELLO message
A node updates its MPR Selector set with information
in the received HELLO messages
16
Protocol functioning MPR information declaration

TC Topology control message:

In order to build intra-forwarding database
Only MPR nodes forward periodically to declare its MPR
Selector set
Message might not be sent if there are no updates
Contains:
MPR Selector
Sequence number

Each node maintains a Topology Table based on TC

messages
Routing Tables are calculated based on Topology tables

17
Protocol functioning MPR information declaration (cont.)

Destination address Destinations MPR MPR Selector Holding time

sequence
number

MPR Selector in Last-hop node to the

the received TC destination.
message Originator of TC
message

Table 3. Topology table

18
Protocol functioning MPR information declaration (cont.)

E F

Send TC message
D C B
{B,D,E} build the topology
table
MS(C) = {B,D,E} MPR(B) = {A,C}

Figure 4. TC message and Topology table

19
Protocol functioning MPR information declaration (cont.)

Upon receipt of TC message:

If there exist some entry to the same destination with higher
Sequence Number, the TC message is ignored

If there exist some entry to the same destination with lower

Sequence Number, the topology entry is removed and the
new one is recorded

If the entry is the same as in TC message, the holding time of

this entry is refreshed

If there are no corresponding entry the new entry is

recorded

20
Protocol functioning MPR information declaration (cont.)

MPR
Dest
Dest MPR Selector
address
sequence

X M 1
S
Y M 1
P
Z M 1

.. .. .. M

S Topology table Z
X Y
R
TC MPR selector A B
MPR selector
originator sequence
D Send TC message
M X 2

M Y 2

M Z 2

M R 2

Figure 5. Topology table update

TC message ( M send to S)

21
Protocol functioning Routing table calculation

Each node maintains a routing table to all known

destinations in the network
After each node TC message receives, store connected pairs of
form ( last-hop, node)
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

22
Protocol functioning Routing table calculation (cont.)

Source

Destination

Figure 5. Building a route from topology table

23
conclusion
OLSR protocol is proactive or table driven in nature
Advantages
Route immediately available
Minimize flooding by using MPR

OLSR protocol is suitable for large and dense networks

24