Submitted By :Arijit Karati Sanjana Prasad

What is Ad-hoc routing ?. Why it is needed ?.

Various types of Ad-hoc routing :

Pro-active routing technique. Reactive routing technique. Hybrid routing technique. Other routing techniques.
2

WMNs Routing protocols

Pro-active protocols

Reactive protocols

Hybrid protocols

DSDV(Destination
Sequence Distance Vector)

DSR(Dynamic Source Routing)

AODV(Ad hoc Ondemand Distance

OLSR (Optimized
Link State Routing)

Vector)
3

Table driven approach. table contains : Destination. And routes.

periodically monitoring peer connectivity to ensure ready availability of any path amongst active nodes.
4

Advantages :

Disadvantages

:-

Respective amount of data for maintenance.

Slow reaction on restructuring and failures.
5

DSDV is a proactive type of routing protocol. It is based on Bellman-Ford algorithm(the Bellman-Ford algorithm use the distance vector approach). Advantages : Suitable for small number of nodes.
6

 Other protocols have borrowed similar techniques

(e.g. AODV).
It is also loop free path.
Disadvantages

:-

Congestion control is bad. Not suitable for highly dynamic networks. No formal specification, no significant commercial

implementation.
7

It is a pro-active routing protocol. The concept used in the protocol is that of multipoint relays (MPRs).

This technique provides two key optimization

Reduce the size of control packets. Flooding of the control traffic is minimized by

using only the selected nodes.

8

Advantages : no route discovery delay associated with finding a

new route. Throughput; Better when compare to DSDV. Routing overhead is greater than that of a reactive protocol.

Disadvantages : It is not scalable for WMN (Wireless Mess Networks). Require sufficient CPU power to compute optimal

paths in the network.

9

 In the typical networks where OLSR is used.

Some other algorithms : Babel.

B.A.T.M.A.N.
HSR. HSLS.

WAR.

10

On-demand approach. Finds a route by flooding the network with Route Request packets. The main disadvantage of such algorithms is : High latency time in route finding.

Excessive flooding can lead to network clogging.

11

It is a simple and efficient on demand routing protocol. Designed for multi-wireless mesh network. Based on two mechanism
Route discovery.
Route maintenance.
12

 Route

Discovery : -

It is the process of DSR uses to find the route. Transmit the data from a source to destination

where the source node is unaware of the destination route.

Route

Maintenance : -

Notice when communication link is broken. Lead to failure of the communication between

source and destination node.

13

Advantages : Loop free routing. Support unidirectional link. Rapid recovery when routes in the network

change.

Disadvantages : Implementing the route discovery process.

Not scalable for the WMN.

14

It is developed as an improvement of DSDV routing algorithm. AODV uses a simple requestreply mechanism for the discovery of routes. It mainly involve s 3 packets, they are : route request (RREQ)
route reply (RREP) route error (RERR)
15

Advantages : It is reliable for wireless mesh networks. It is loop free. It does not require any centralized system.

Disadvantages : Path may be lost due to traffic during the path

discovering process. Do not utilized any congestion control mechanism to balance traffic load.
16

Some other algorithms : Ariadne . Endaira. AORP.

Back up Source Routing.

Associativity-Based Routing.

17

This type of protocols combines the advantages of proactive and of reactive routing.
Proactive for neighbourhood.
Reactive for far away.

Some hybrid routing : HRPLS. HWMP. ZRP.

18

Finds a route on demand by following present flows. Main disadvantage of it,

It takes long time when exploring new routes

without a prior knowledge.

Some flow-oriented routing

FR & PR. SSR. LUNAR.
19

There are many routing techniques which is not described in this slides like
Hierarchical routing protocol. Backpressure routing protocol. Host specific routing protocol. Multicasting routing protocol. Power-aware routing protocol.

Geographical routing protocol.

20

Thank You