MANET

Dr. Nguyen Tuan Nam songuku99@yahoo.com

MANET
Mobile ad hoc network
Mobile SelfSelf-configured on the fly No infrastructure Collection of hosts with wireless interface Physical constraint Quick deployment Economic concern Emergency (earthquake flood) (earthquake,
Nguyen Tuan Nam/WNC 2010 2

When do we need it?

Problem
Communication range? Which path to take? Link changed frequently No dedicated server/router

Can we borrow the same schemes/algorithms from traditional wired network?

Nguyen Tuan Nam/WNC 2010

What will Affect the Routing g Scheme?

Number of nodes and density Type of movement (together, uniform) Movement speed Bidirectional links (one may ok the other ok,
not) P Power consumption: i
Laptop vs vehicle

Location awareness
Nguyen Tuan Nam/WNC 2010 4

Issues
C Correctness/Reliability / l bl Overhead
Fairness Selfishness Transmission range vs density Membership Security
Bandwidth Power

Nguyen Tuan Nam/WNC 2010

What is the Simplest Routing p g Scheme?

131.179.192.3 131.179.192.2 131.179.192.6

Simplest algorithm?
131.179.192.4

131.179.192.5

How x.x.x.2 send packet Hello, world to x.x.x.6 ?

Nguyen Tuan Nam/WNC 2010

131.179.192.7

Flood Data Packet

Source broadcasts data Received-stations rebroadcast Received Finally packets reach destination Overhead?
Bandwidth C lli i Collisions Power
Nguyen Tuan Nam/WNC 2010 7

Optimization Using Neighbor List

Neighbor:
Within transmission range g

Check neighbor list before flooding How to maintain neighbor list

Nguyen Tuan Nam/WNC 2010

Optimization by Recycling Path

Problem: flooding every time sending data
packet Reduce flooding:
Find a path Recycle the previous path

How?
Find a path Maintain paths
Nguyen Tuan Nam/WNC 2010 9

Route Request
Source needs to send packet to
destination Source initially discovers the route:
Send a broadcast RREQ RREQ is propagated to destination using flooding Recorded the node when RREQ goes through Destination knows the path
Nguyen Tuan Nam/WNC 2010 10

RREQ
7 knows the path, path but 2 still not!!! 2,3 1 2 3 2 2 2 need to send Data to 7 Will 7 always receive RREQ from 2 if graph connected? 2,3 5 How to avoid looping of RREQ? Will all neighbors receive RREQ? 4 2,3,5,6 2,3,4 6 2,3,5 Duplicate RREQ? 7

Nguyen Tuan Nam/WNC 2010

11

Route Reply
Destination needs to inform the source
Use the reverse path (RREP contains the newly discovered path) Initiate another RREQ back to the source Q

about the newly discovered path RREP How to send back the RREP?

Nguyen Tuan Nam/WNC 2010

12

RREP (using Reverse Path)

If 2 d doesnt receive t i RREP, what does it mean? 2,3 1 2 3 2 2 7,6,5,3,2 7,6,5,3,2 76532 If 7 received multiple RREQ, which one send back to 2? 2,3 5 Can C a RREP get l t? t lost? 4

2,3,5,6 ,3,5,6 2,3,4 6 2,3,5

7 7,6,5,3,2

7,6,5,3,2 Unicast or Broadcast?

Nguyen Tuan Nam/WNC 2010

13

Transmit Data Packet

Quick recap
Source sends out RREQ Destination sends back RREP upon receiving the RREQ

After receiving the RREP, the source now knows g ,

the complete path to destination Source
Send data through that path Need to include the complete source path in the data p packet
Nguyen Tuan Nam/WNC 2010 14

Transmit Data Packet

Unicast or Broadcast? 4 1 3 2 2,3,5,6,7 DATA 2,3,5,6,7 5 DATA 2,3,5,6,7 7 DATA 6 2,3,5,6,7 DATA DATA

2,3,5,6,7

Nguyen Tuan Nam/WNC 2010

15

Quiz
How long is the connection setup? To reduce the connection setup time,

should we attach the first data packet into the RREQ packet? Will the path work forever? How do we know when we need a new path?

Nguyen Tuan Nam/WNC 2010

16

RERR
Assume we f d a path (x1, x2, x3, x4, x5) found h( 2 3 ) x1 starts to use the path to transmit data to x5 If the link between x3 and x4 is broken How about the data packets arrived at x3?
Cant forward the data packets to x4 x3 need to notify the source x1. How? Send RERR packet back to x1

Drop Self-recover Self Send using alternate route in cache (salvaging) (salvaging) Gratuitous route repair: source piggybacks RERR in repair: source the next RREQ to clean up caches of other nodes
Nguyen Tuan Nam/WNC 2010 17

Quiz
How do we detect if the link between the
2 nodes is broken?

Nguyen Tuan Nam/WNC 2010

18

CSMA/CA with NAV

DIFS RTS Source SIFS Dest CTS SIFS SIFS ACK DIFS DATA

NAV (RTS) NAV (CTS)

Nguyen Tuan Nam/WNC 2010

19

Quiz
How do we detect if the link between the
2 nodes is broken if there is no support from the data link layer?

Nguyen Tuan Nam/WNC 2010

20

Route Maintenance
If the source receives RERR it needs to
find a new route to the destination Re-send RREQ Re Everything repeat

Nguyen Tuan Nam/WNC 2010

21

Optimization
Before fl d RREQ f flooding Q Route cache:
Check if the destination is in the route cache Each node checks cache before sending RREQ RREQ packets are saved in the cache of each intermediate node Early return of RREP. Any problem? Eavesdrop RREQ to update local cache Eavesdrop RERR to update local cache Eavesdrop Data to send gratuitous RREP If packet can be routed via itself to gain a shorter route
Nguyen Tuan Nam/WNC 2010 22

Promiscuous mode:

Quiz
In the RREQ step, which network better:
Sparse network p Dense network

Nguyen Tuan Nam/WNC 2010

23