Dynamic Source Routing in Ad hoc Wireless Networks

1
Dynamic Source Routing in Ad hoc Wireless
Networks

• ???????
• ???????

2
Contents

• Introduction
• Assumptions
• Basic Operation
• Optimization
• Conclusion

3
Introduction -1

• What is ad hoc network?
• No fixed wired infrastructure
• Routing
• When two hosts are not within wireless
  transmission range, other hosts between them
  forward packets

4
Introduction -2

• Routing protocols in conventional wired networks
• Distance vector
• Each router broadcasts to each of its neighbor
  routers its view of the distance to all hosts
• Link state
• Each router broadcasts to all other routers in
  the network its view of the status of each of its
  adjacent network link

5
Introduction-3

• Dynamic source routing
• The sender of a packet determines the complete
  sequence of nodes through which to forward the
  packet
• Dynamically determines a route based on
• 1. Cached information
• 2. The result of a route discovery

6
Introduction-4

• The advantages of DSR
• No periodic routing advertisement messages
• 1.bandwidth
• 2. battery power
• Don't require transmissions between hosts to
  work bidirectionally
• Be able to adapt quickly to changes

7
Assumptions

• All hosts participate fully in the protocols of
  the network
• forward packets for other hosts
• Diameter
• Hosts can move but the speed is moderate
• Promiscuous receive mode

8
Basic Operation - Overview

• The sender constructs a source route in the
  packet's header
• If the receiver is the destination host, sends a
  route reply
• Else forward packets
• Each host maintains a route cache
• If no route cache is found, use the route
  discovery
• Hosts monitor the operation of the route and use
  the route maintenance

9
Basic Operation Route Discovery-1

• The sender
• Broadcast a route request packet
• The receiver
• ltinitiator address, request idgt
• If same, discard
• This host's address is already listed in the
  route record - loop
• Discard
• This host is the target
• Send a route reply
• Else
• Append this host's address to the route record,
  and re-broadcast

10
Basic Operation Route Discovery-2
B
G
D
A
H
E
C
F
11
Basic Operation Route Maintenance-1

• No periodic messages
• Monitors the operation of the route and informs
  the sender of any routing errors
• Utilize a hop-by-hop acknowledgement
• At the data link level
• The route error packet
• Contains the addresses of the hosts at both ends
  of the hop in error
• Removed from the route cache
• Send to the sender
• Route cache, reverse the route from the packet in
  error, route discovery
• Passive acknowledgement
• promiscuous mode

12
Basic Operation Route Maintenance-2
B
G
D
I
A
H
E
Route Cache (A)G A, B, D, G
C
F
13
Optimization Full Use of the Route Cache-1

• A tree of routes rooted at this host, to other
  hosts in the ad hoc network
• A hop can add entries to its route cache any time
  it learns a new route
• Intermediate hop
• Promiscuous mode
• If the host has a route cache entry for the
  target, return a route reply without
  re-broadcasting
• Congestion
• Loop
• The host discards the request if the route in its
  reply would contain a loop

14
Optimization Full Use of the Route Cache-2

• Specify the maximum number of hops over which the
  packet may be propagated
• Procedure
• To perform a route discovery, send the route
  request with a hop limit of one
• If no route reply is received, send a new route
  request with a hop limit of the maximum value
• Purpose
• Check if the target is currently within wireless
  transmitter range

15
Optimization Piggybacking Reflecting shorter
routes-1

• Piggybacking on route discoveries
• Small data packets can be piggybacked
• Ex) initial SYN packet opening a TCP connection
• Problem
• When replied based on the host's route cache,
  data would be lost
• Construct and send a new packet containing the
  piggybacked data

16
Optimization Piggybacking Reflecting shorter
routes-2

• Reflecting shorter routes
• Possible if hosts operate their network
  interfaces in promiscuous receive mode
• Send unsolicited route reply packet to the
  original sender

17
Optimization Improved Handling of Errors -1

• Use exponential backoff
• When the network becomes partitioned
• To limit the rate at which new route discoveries
  may be initiated from any host for the same
  target
• In order to reduce the overhead
• Eavesdrop on route error packets being sent to
  other hosts

18
Optimization Improved Handling of Errors -2

• Different route
• Once the route error packet reaches the original
  sender, retransmits the route error packet back
  to the point of error
• Caching negative information in a host's route
  cache
• Hosts can ignore replies
• Short expiration period must be placed

19
Conclusion

• Dynamic source routing protocol
• Routing packets between wireless mobile hosts in
  an ad hoc network
• Adapts quickly to routing changes
• Route lengths are on average within a factor of
  1.02 of optimal
• Incorporate some additional optimizations
• Future work
• Interconnection of an ad hoc network with a
  wide-area network such as the Internet
• Security