Interna'onal

University MITM Class

Rou'ng Protocols in MANET

Presented by: Hai Ha-Son Instructor: Quan Le-Trung

Interna'onal University MITM Class

Contents
Introduc'on Rou'ng basics
Distance vector algorithms Link-state algorithms

Example MANET rou'ng protocols

OLSR AODV (be omiKed)

Interna'onal University MITM Class

Introduc'on
Two type of wireless networks:
Infrastructured network:
Base sta'on are the bridges A mobile host will communicate with the nearest base sta'on Hando is taken when a host roams from one base to another Infrastructureless: no xed base sta'ons Without the assistance of base sta'ons for communica'on Mul'-hop rou'ng for communica'on Quickly and unpredictably changing topology

Ad hoc network:

Interna'onal University MITM Class

MANET
MANET = Mobile Ad Hoc Networks
A set of mobile hosts, each with a transceiver No base sta'ons; no xed network infrastructure Mul@-hop communica'on Needs a rou'ng protocol which can handle changing topology

Interna'onal University MITM Class

Rou'ng basics
Rou'ng consists of two fundamental steps
Forwarding packets to the next hop Determining how to forward packets

Forwarding packets is easy, but knowing where forward packets eciently is hard
Reach the des'na'on Minimize the number of hops (path length) Minimize delay Minimize packet loss Minimize cost

Interna'onal University MITM Class

Rou'ng Decision Point

Source rou'ng
Sender determines a route and species it in the packet header Supported in IP, although not the typical rou'ng scheme

Hop-by-hop rou'ng
A rou'ng decision is made at each forwarding point Standard rou'ng scheme for IP

Virtual circuit rou'ng

Determine and congure a path prior to sending rst path Used in ATM (and analogous to voice telephone systems)

Interna'onal University MITM Class

Rou'ng Table
A rou'ng table contains informa'on to determine how to forward packets
Source rou'ng Hop-by-hop rou'ng Virtual circuit rou'ng

A distributed algorithm is required to build the rou'ng table

Distance vector algorithms Link state algorithms

Interna'onal University MITM Class

Distance Vector Algorithms (1)

Distance of each link in the network is a metric that is to be minimized
Each link may have distance 1 to minimize hop count Algorithm aKempts to minimize distance Species the next hop for each des'na'on Species the distance to that des'na'on

The rou'ng table at each node:

Neighbors can exchange rou'ng table informa'on nd a route (or a beKer route) to des'na'on

Interna'onal University MITM Class

Distance Vector Algorithms (2)

Interna'onal University MITM Class

10

Distance Vector Algorithms (3)

Node A will learn of node Cs shorter path to node D and update its rou'ng table

Interna'onal University MITM Class

11

Link-State Algorithms (1)

Each node shares its link informa'on so that all nodes can build a map of the full network topology Link informa'on is updated when a link changes state (goes up or down)
Link state determined by sending small hello packets to neighbors

Given full topology informa'on, a node can determine the next best hop or a route from the source

Interna'onal University MITM Class

12

Link-State Algorithms (2)

Assuming the topology is stable for a suciently long period, all nodes will have the same topology informa'on

Interna'onal University MITM Class

13

Link-State Algorithms (3)

Nodes A and C propagate the existence of link A-C to their neighbors and, eventually, to the en're network

Interna'onal University MITM Class

14

Types of Manet Rou'ng

Interna'onal University MITM Class

15

OLSR Concepts (1)

Op'mized Link State Rou'ng (OLSR) protocol Proac've (table-driven) rou'ng protocol Based on the link-state algorithm
A route is available immediately when needed Tradi'onally, all nodes ood neighbor informa'on in a link-state protocol, but not in OLSR Reduces size of control packets

Nodes adver'se informa'on only about links with neighbors who are in its mul$point relay selector set

Reduces ooding by using only mul$point relay nodes to send informa'on in the network
Reduces number of control packets by reducing duplicate transmissions

Interna'onal University MITM Class

16

OLSR Concepts (2)

Does not require reliable transfer, since updates are sent periodically Does not need in-order delivery, since sequence numbers are used to prevent out- of-date informa'on from being misinterpreted Uses hop-by-hop rou'ng
Routes are based on dynamic table entries maintained at intermediate nodes

Interna'onal University MITM Class

17

Mul'point Relay Set

Each node N in the network selects a set of neighbor nodes as mul'point relays, MPR(N), that retransmit control packets from N
Neighbors not in MPR(N) process control packets from N, but they do not forward the packets

MPR(N) is selected such that all two-hop neighbors of N are covered by (one-hop neighbors) of MPR(N)
One op@mal set for node 4: MPR(4) = {3, 6}

Interna'onal University MITM Class

18

Mul'point Relay Selector Set

The mul'point relay selector set for Node N, MS(N), is the set of nodes that choose Node N in their mul'point relay set
Only links N-M, for all M such that NMS(M) will be adver'sed in control messages

MS(3) = {, 4,} MS(6) = {, 4,}

Interna'onal University MITM Class

19

Hello Messages (1)

Each node uses HELLO messages to determine its MPR set All nodes periodically broadcast HELLO messages to their one-hop neighbors (bidirec'onal links) HELLO messages are not forwarded

Interna'onal University MITM Class

20

Hello Messages (2)

Using the neighbor list in received HELLO messages, nodes can determine their two-hop neighborhood and an op'mal (or near-op'mal) MPR set A sequence number is associated with this MPR set
Sequence number is incremented each 'me a new set is calculated

Interna'onal University MITM Class

21

Hello Messages (3)

Subsequent HELLO messages also indicate neighbors that are in the nodes MPR set MPR set is recalculated when a change in the one-hop or two-hop neighborhood is detected

Interna'onal University MITM Class

22

TC Messages
Nodes send topology informa'on in Topology Control (TC) messages
List of adver'sed neighbors (link informa'on) Sequence number (to prevent use of stale informa'on)

A node generates TC messages only for those neighbors in its MS set

Only MPR nodes generate TC messages Not all links are adver'sed

A nodes processes all received TC messages, but only forwards TC messages if the sender is in its MS set
Only MPR nodes propagate TC messages

Interna'onal University MITM Class

23

OLSR Example (1)

Interna'onal University MITM Class

24

OLSR Example (2)

Node 3 generates a TC message adver'sing nodes in MS(3) = {2, 4, 5} Node 4 forwards Node 3s TC message since Node 3 MS(4) = {1, 3, 5, 6} Node 6 forwards TC(3) since Node 4 MS(6)

MS(3) = {2, 4, 5}

Interna'onal University MITM Class

25

OLSR Example (3)

Node 4 generates a TC message adver'sing nodes in MS(4) = {1, 3, 5, 6} Nodes 3 and 6 forward TC(4) since Node 4 MS(3) and Node 4 MS(6)

Interna'onal University MITM Class

26

OLSR Example (4)

Node 6 generates a TC message adver'sing nodes in MS(6) = {4, 5, 7} Node 4 forwards TC(6) from Node 6 and Node 3 forwards TC(6) from Node 4 Ajer Nodes 3, 4, and 6 have generated TC messages, all nodes have link-state informa'on to route to any node

Interna'onal University MITM Class

27

OLSR Example (5)

Given TC informa'on, each node forms a topology table A rou'ng table is calculated from the topology table Note that Link 1-2 is not visible except to Nodes 2 and 3

Interna'onal University MITM Class

28

References
Mobile Networks: IP Rou$ng and MANET Rou$ng Algorithms Revised slide by Quan Le-Trung A Review of Current Rou$ng Protocols for Ad Hoc Mobile Wireless Networks - E. Royer and C.-K. Toh Mobile Ad-hoc Networks tutorial at CIT2000 - Sridhar Iyer

Interna'onal University MITM Class

29

Discussion

Interna'onal University MITM Class

30

Thank you for your aVen@on!