Academy of Graduate Studies, Misurata Computer Science Department Computer Networks CS503

Routing in wireless and Ad-hoc networks

Prepared by: Ibrahim abu fanas Supervisor: El-Bahlul Fgee
Date 28-06-2010 12:00

Outline
What is Ad Hoc Wireless Network ? Routing Protocol Table Driven Routing Protocol Source-initiated On-demand Routing Protocol

What is Ad Hoc Wireless Network?

A collection of mobile nodes that are dynamically and arbitrarily located Each node must act as a router Most nodes will not wish to perform any administrative actions to set up such a network.

Routing Protocols
Ad -Hoc Routing Protocols

Table Driven

Source -initiated On- Demand Driven

DSDV

WRP

AODV DSR

TORA

ABR

CGSR SSR

Table Driven Routing Protocol

Attempt to maintain consistent, up-to-date routing information from each node to every other node in the network The number of necessary routing-related tables and methods of broadcasting are different

Destination-Sequenced Distance-Vector Routing (DSDV)

A table based protocol Every node maintains a complete table listed all possible destination Each entry of the table marked with a sequence number assigned by the destination node

DSDV (continue)

Every node keep a route table <Destination-address, Metric, Sequence-number> for every possible destination

Source-initiated On-demand Routing Protocol

Initiates a route discovery process within the network, when a node requires a route to a destination Maintain by some form of route maintenance procedure until either the destination becomes inaccessible or the route is not desired

Ad-hoc On-demand Distance Vector Routing (AODV)

An on demand routing protocol Description AODV uses a broadcast route discovery mechanism as is also used in DSR. Instead of source routing, however, AODV relies on dynamically establishing route table entries at intermediate nodes

AODV (continue)

A mobile node maintains a table entry for each destination of interest. Route table entry contains the following information: Destination Next Hop Number of hops (metric) Sequence number for the destination Active neighbors for this route Expiration time for the route table entry Source node sends a RREQ packet Intermediate nodes forward it to destination Destination node distinguish the RREQ by <broadcastID, source-address>, and sends back RREP when receives the first RREQ packet.

Dynamic Source Routing (DSR)

An on-demand routing protocol Description

source flood REQUEST if it has data to send but no route to its destination is know When the destination get the REQUEST, it sends a REPLY to the source via the recorded route Use source routing instead of hop-to-hop routing

DSR continue

Every node has a cache which contain the complete path information to the destination node If the source node cant find the destination node in its cache, it will initial a route discovery The source node sends the RREQ packet which is <source-address, destination-address, route-record, request-id> Intermediate node

If it is the destination copy the head and send RREP If it is already listed in the route-record, discard it Else, it forward the RREQ, and add itself in the route-record

Table-Driven vs On-Demand Routing

Table-Driven
is

similar to the connectionless approach of forwarding packets, with no regard to when and how frequent such routes are desired A routing is always available, regardless whether or not it is needed

On-Demand
Has

to wait until a desired route is discovered.

Thanks