Introduction to Ad Hoc Networks Brief review about Ad-hoc Routing

DSR AODV

Properties Difficulties Security

Introduction

What is Ad-hoc?

A collection of wireless hosts forming a temporary network No aid of any established infrastructure or centralized administration No aid of any wired architecture

Where is Ad-hoc used?

Military purpose Post-diaster rescue team

Two Main Categories of Ad-hoc Routing

Pro-active Routing

Configure the routes toward any node before packet transmission Traditional mothod for Wired Network DSDV, etc..

On-Demand Routing

Find the route just before packet transmission Due to the high cost of wireless bandwidth DSR, AODV, etc...

On-Demand Method

Route Discovery

by a node which has some packet to send

Route Reply

by the goal node or an intermediate node which knows the route from itself to the goal node Loop-free Short and efficient

Route Maintenance

If link-error is detected, re-initiate the route discovery process

DSR

Dynamic Source Routing

Dynamic : On-demand Source Routing

Sender tells the entire route of its packet explicitly

Properties

On-demand : No periodic announcement No routing table

Sender must find the route

DSR

Route Discovery (Simple)

1.

A host initiating a route discovery broadcasts a Route Request packet. Then it waits for a Route Reply packet If a host receives a Route Request packet, it conducts as below
1.

2.

2.

3.

4.

If the packet have been received already, just drop and do nothing O/w, if the address of itself is listed in the Route Record, just drop and do nothing O/w, if the target of the packet is itself, send a Route Reply packet with a route of Route Record O/w, append its address to the Route Record in the Route Request packet and re-breadcast the request

3.

When the original sender receives a Route Reply packet, it updates its Route Cache

DSR

Route Request packet contains

<initiator address, request id> pair Destination address Route Record some more?

Each node maintains

Recent <initiator address, request id> pairs Request id Route Cache some more?

DSR

Route Discovery and Reply

<A,1 E ABCD > D C <A,1 E ABC > B <A,1 E AB >

A

E <A,1 E ABCD

>

<A,1 E A >
<A,1 E AF >

<A,1 E AFG >

DSR

Route Maintenance

Without periodic messages, Route informations must become outof-time If a host on the route detect a transmission problem for which it cannot recover, it send a Route Error packet to the original sender

Data link level error reporting Passive acknowledgement Transport / Application level Ack

Route Error packet contains the addresses of the hosts at both ends of the hop in error When a Route Error packet is received, the hop in error is removed from the original senders route cache and resend the Route Request packet

Resource Usage

MEMORY: CPU USAGE: NUMBER OF PACKETS: BANDWIDTH UTILIZATIONS:

SCALABILITY

DSR does not appear to be very scalable protocol because each host must keep the full knowledge of the paths to communicate with. In case of densely connected network, there can be lot of problems. This will grow linearly per host and over the network in the worst case.

AODV

Ad-hoc On-Demand Distance Vector Routing

Similar to DSR, but AODV uses Routing Table instead of Source routing The node receiving a packet knows who sent it While the Route Request packet propagates, reverse path is made Route Reply packet returns along the reverse path, setting up the routing table of the intermediate nodes

AODV

Each node has

Broadcast_id ( = request_id in DSR) Sequence_number : freshness

Each Route Table entry contains

Destination Next Hop Number of Hop (metric) Sequence number for the destination Active neighbors for this route Expiration time for the route table entry

ASPECTS OF AODV
Path Discovery Path discovery is used when there is no available route to the destination node in the source node. There are two types of path setup: 1)Reverse path setup 2)Forward path setup

REVERSE PATH

As each node receives and forwards a new path discovery request it stores the node that it received the request from before it re-broadcasts the path discovery. Reverse path setup is based on route request and not on route reply.

AODV

Route Request (RREQ) - Reverse Path Setup A A A A B

B A F

C
D
E

FORWARD PATH

If a node forwards a path discovery request it must listen for the path discovery response. A valid response means that it has reached to the right destination. It is also possible that more than one response are there at the source node.

AODV

Route Reply (RREP) Forward Path Setup E A

C B A G F time out

E A E A E C A B

D B

E C D

AODV

Path Maintenance

If a node detect its next hop-link is broken, it propagates an unsolicited RREP with a fresh seq-num and infinite hop-cnt to all active upstream neighbors When the original sender receives the RREP from the broken link, it may restart the discovery process

It send a RREQ with dest_seq_num +1 Even if the intermediate node still regard the previous route valid, the new RREQ has greater dest_seq_num so that new discovery process will begin

AODV ANALYSIS

MEMORY: CPU USAGE: NO. OF PACKETS: BANDWIDTH UTILIZATIONS:

PROPERTIES

Wireless links Low Bandwidth High Power Consumption Frequent Topology Changes

Difficulties of Ad-hoc Routing

Differences to Wired Network

Hosts move freely Bidirectional communication is not guaranteed Resourcus are much more expansive

Periodic announcement is unappropriate On-demand methods

Differences to typical Wireless Network

Every

host must act like a router

No hand-off Instead, Network partitioning

SECURITY
Security is an important issue for ad hoc networks, especially for those security sensitive applications. To secure ad hoc network, we have to consider following attributes: 1)Availability 2)Confidentiality 3)Integrity 4)Authentication 5)Non-repudiation

RESOURCES

www.adnet.com www.howstuffworks.com D.Jhonson and D.Maltz (Source Routing in Wireless Networks).