Optimized Link State Routing

Protocol for Ad Hoc Networks

Presented by Yuyan Xue

Yuyan Xue OLSR Protocol 1

 Overview

The Optimized Link State Routing Protocol (OLSR) is a

table driven, proactive protocol, i.e., exchanges topology
information with other nodes of the network regularly.
Each node selects a set of its neighbor nodes as "multipoint
relays" (MPR).
Only nodes, selected as such MPRs, are responsible for
forwarding control traffic, intended for diffusion into the
entire network.

Yuyan Xue OLSR Protocol 2

 Feature

Inherit Stability of Link-state protocol

Multipoint Relays (MPR) employed for

selective flooding

Control traffic by reducing the number of

transmissions required.

Yuyan Xue OLSR Protocol 3

 Protocol Operation

Neighbor Sensing

MPR Selection

MPR Information Declaration

Routing Table Construction

Yuyan Xue OLSR Protocol 4

 Neighbor Sensing – Hello Message

 Each node periodically broadcasts Hello message:

 List of neighbors with bi-directional link

 List of other known neighbors.

 Hello messages permit each node

to learn topology up to 2 hops

 Based on Hello messages each

node selects its set of MPR’s

Yuyan Xue OLSR Protocol 5

 MPR Selection

 Each node select a set

of MPR Selectors
Y

 Who can be a MPR Selectors

S
of node N ?
- one-hop neighbors of N
X M
 MPR set of Node N (Rules) D

(1) Set of MPR’s is able to Z

transmit to all two-hop neighbors

(2) Link between node and it’s MPR is

A B
bidirectional.

Yuyan Xue OLSR Protocol 6

 MPR Selection – Con.

Node 1 Hop Neighbors 2 Hop Neighbors MPR(s)

B A,C,F,G D,E C

5 10
 Node B will select C as its
MPR So all the other nodes 3 10
know 60
40
that they can reach B via C
25
 D->B route is D-C-B, whose
110 50
bottleneck BW is 3 ( Not BW
optimal) 100

30
Yuyan Xue OLSR Protocol 7
 MPR Information Declaration

 Topology Control Message (TC)

 Send if there are updates
 Contains:
 MPR Selector Table

 Sequence number

 Topology Table
 Each node maintains a Topology Table based on TC
messages
 Routing Tables are calculated based on Topology tables

Yuyan Xue OLSR Protocol 8

 Routing Table Construction

 Each node maintains a routing table to all known

destinations in the network

 Routing table:
 Destination address
 Next Hop address
 Distance

 Routing Table is calculated from Topology Table and

recalculated after every change in neighborhood table
or in topological table

Yuyan Xue OLSR Protocol 9

 References

 G. Pei, M. Gerla, and X. Hong, "

LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Networks w
," In Proceedings of IEEE/ACM MobiHOC 2000, Boston, MA, Aug.
2000.
 Thomas Clausen, Philippe Jacquet, "
Optimized Link State Routing Protocol (OLSR) ," IETF Internet
Draft , July 3 2003.
 X. Hong, K. Xu, and M. Gerla, "
Scalable Routing Protocols for Mobile Ad Hoc Networks " IEEE
Network Magazine, July-Aug, 2002, pp. 11-21

Yuyan Xue OLSR Protocol 10