Wireless Adhoc Networks

Organization
 Introduction
 Challenges
 Application
 Effects of Mobility
 Routing
 Case Study
 Simulators
 Conclusions

03/05/25 17:57 2
 Introduction-Ad hoc Network
 Autonomous and infrastructure-less
 Multi-hop routes between nodes
 Nodes act as a routers

03/05/25 3
 Infrastructure vs Ad hoc WLANs
infrastructure
network
AP: Access Point
AP

AP wired network
AP

ad-hoc network

03/05/25 4
 Why Ad Hoc Networks ?
 Setting up of fixed access points and backbone infrastructure is
not always viable

Infrastructure may not be present in a disaster area or war
zone

Infrastructure may not be practical for short-range radios;
Bluetooth (range ~ 10m)

 Ad hoc networks

Do not need backbone infrastructure support

Are easy to deploy

Useful when infrastructure is absent, destroyed or impractical

03/05/25 5
 Challenges
 Limitations of the Wireless Network

Packet loss due to transmission errors
 Frequent disconnections/partitions

Limited communication bandwidth

Broadcast nature of the communications

 Limitations Imposed by Mobility

 Dynamically changing topologies/routes
 Lack of mobility awareness by system/applications

 Limitations of the Mobile Computer


Short battery lifetime
 Limited capacities

 Scalability

03/05/25 6
 Applications
 Personal area networking
 cell phone, laptop

 Military environments
 soldiers, tanks, planes

 Civilian environments
 taxi cab network
 meeting rooms
 sports stadiums
 boats, small aircraft

 Emergency operations
 search-and-rescue
 policing and fire fighting
03/05/25 7
MANET in Military Environment

03/05/25 8
MANET in Military Environment

03/05/25 9
MANET in Civilian Environment

03/05/25 10
 Effect of mobility on the protocol stack
 Application
 New applications and adaptations
 Transport
 Congestion and flow control
 Network
 Addressing and routing
 Link
 Media access and handoff
 Physical
 Transmission errors and interference

03/05/25 11
 Routing and Mobility
 Finding a path from a source to a destination
 Issues
 Frequent route changes
 Route changes may be related to host movement
 Low bandwidth links

 Goal of routing protocols

 decrease routing-related overhead
 find short routes
 find “stable” routes (despite mobility)

03/05/25 12
Categorization Of Ad hoc Routing Protocols

Ad hoc Routing Protocols

Proactive Protocols Reactive Protocols

Hybrid Protocols

DSDV WRP FSR ZRP AODV DSR ABR

03/05/25 13
 Routing Protocols
 Proactive protocols
 Maintain routes between every host pair at all times
 Based on periodic updates
 High routing overhead

 Reactive protocols
 Determine route if and when needed
 Source initiates route discovery

 Hybrid protocols
 Combination of proactive and reactive

03/05/25 14
 Protocol Trade-offs
 Proactive protocols
 Little or no delay for route determination
 Consume bandwidth to keep routes up-to-date
 Maintain routes which may never be used

 Reactive protocols
 Lower overhead since routes are determined on demand
 Significant delay in route determination
 Employ flooding (global search)
 Control traffic may be bursty

 Which approach achieves a better trade-off depends on the

traffic and mobility patterns
03/05/25 15
03/05/25 16
03/05/25 17
03/05/25 18
03/05/25 19
03/05/25 20
03/05/25 21
03/05/25 22
 Case Study : Dynamic Source
Routing (DSR)
 When node S wants to send a packet to node D, but
does not know a route to D, node S initiates a route
discovery

 Source node S floods Route Request (RREQ)

 Each node appends own identifier when forwarding

RREQ

03/05/25 23
 Route Discovery in DSR
Y

Z
S E
F
B
C M L
J
A G
H D
K
I N

Represents a node that has received RREQ for D from S

03/05/25 24
 Route Discovery in DSR
Y
Broadcast transmission
[S] Z
S E
F
B
C M L
J
A G
H D
K
I N

Represents transmission of RREQ

[X,Y] Represents list of identifiers appended to RREQ

03/05/25 25
 Route Discovery in DSR
Y

Z
[S,E]
S E
F
B
C M L
J
A [S,C] G
H D
K
I N

• Node H receives packet RREQ from two neighbors:

potential for collision
03/05/25 26
 Route Discovery in DSR
Y

Z
S E
F [S,E,F]
B
C M L
J
A G
H D
[S,C,G] K
I N

• Node C receives RREQ from G and H, but does not forward

it again, because node C has already forwarded RREQ once

03/05/25 27
 Route Discovery in DSR
Y

Z
S E
F [S,E,F,J]
B
C M L
J
A G
H D
K
I [S,C,G,K] N

• Nodes J and K both broadcast RREQ to node D

• Since nodes J and K are hidden from each other, their
transmissions may collide
03/05/25 28
 Route Discovery in DSR
Y

Z
S E
[S,E,F,J,M]
F
B
C M L
J
A G
H D
K
I N

• Node D does not forward RREQ, because node D

is the intended target of the route discovery
03/05/25 29
 Route Discovery in DSR

 Destination D on receiving the first RREQ, sends a Route Reply

(RREP)

 RREP is sent on a route obtained by reversing the route

appended to received RREQ

 RREP includes the route from S to D on which RREQ was

received by node D

03/05/25 30
 Route Reply in DSR
Y

Z
RREP [S,E,F,J,D]
S E
F
B
C M L
J
A G
H D
K
I N

Represents RREP control message

03/05/25 31
 Route Reply in DSR
 Route Reply can be sent by reversing the route in Route
Request (RREQ) only if links are guaranteed to be bi-
directional
 To ensure this, RREQ should be forwarded only if it

received on a link that is known to be bi-directional

 If unidirectional (asymmetric) links are allowed, then RREP

may need a route discovery for S from node D
 Unless node D already knows a route to node S

 If a route discovery is initiated by D for a route to S, then

the Route Reply is piggybacked on the Route Request

from D.

03/05/25 32
 Dynamic Source Routing (DSR)

 Node S on receiving RREP, caches the route included in the

RREP

 When node S sends a data packet to D, the entire route is

included in the packet header
 hence the name source routing

 Intermediate nodes use the source route included in a packet to

determine to whom a packet should be forwarded

03/05/25 33
 Data Delivery in DSR
Y

DATA [S,E,F,J,D] Z
S E
F
B
C M L
J
A G
H D
K
I N

Packet header size grows with route length

03/05/25 34
 When to Perform a Route Discovery

 When node S wants to send data to node D, but

does not know a valid route node D

03/05/25 35
 Use of Route Caching

[S,E,F,J,D]
[E,F,J,D]
S E [F,J,D],[F,E,S]

F
B [J,F,E,S]
C M L
J
A [C,S] G
H D
[G,C,S]
K
I N

[P,Q,R] Represents cached route at a node

03/05/25 36
DSR Optimization: Route Caching
 Each node caches a new route it learns by any means
 When node S finds route [S,E,F,J,D] to node D, node S also
learns route [S,E,F] to node F
 When node K receives Route Request [S,C,G] destined for node,
node K learns route [K,G,C,S] to node S
 When node F forwards Route Reply RREP [S,E,F,J,D], node F
learns route [F,J,D] to node D
 When node E forwards Data [S,E,F,J,D] it learns route [E,F,J,D]
to node D
 A node may also learn a route when it overhears Data packets

03/05/25 37
 Use of Route Caching

 When node S learns that a route to node D is broken, it uses

another route from its local cache, if such a route to D exists in
its cache. Otherwise, node S initiates route discovery by sending
a route request

 Node X on receiving a Route Request for some node D can send

a Route Reply if node X knows a route to node D

 Use of route cache

 can speed up route discovery

 can reduce propagation of route requests

03/05/25 38
 Use of Route Caching:
Can Speed up Route Discovery

[S,E,F,J,D]
[E,F,J,D]
S E [F,J,D],[F,E,S]
F
B [J,F,E,S]
C [G,C,S] M L
J
A [C,S] G
H D
[K,G,C,S] K
I RREP N
RREQ
Z
When node Z sends a route request
for node C, node K sends back a route
reply [Z,K,G,C] to node Z using a locally
cached route
03/05/25 39
 Route Error (RERR)
Y

RERR [J-D] Z
S E
F
B
C M L
J
A G
H D
K
I N

J sends a route error to S along route J-F-E-S when its attempt to forward the
data packet S (with route SEFJD) on J-D fails

Nodes hearing RERR update their route cache to remove link J-D

03/05/25 40
 Route Caching: Beware!
 Stale caches can adversely affect performance

 With passage of time and host mobility, cached

routes may become invalid

 A sender host may try several stale routes

(obtained from local cache, or replied from
cache by other nodes), before finding a good
route
03/05/25 41
Dynamic Source Routing: Advantages

 Routes maintained only between nodes who need to

communicate
 reduces overhead of route maintenance

 Route caching can further reduce route discovery overhead

 A single route discovery may yield many routes to the

destination, due to intermediate nodes replying from local
caches

03/05/25 42
Dynamic Source Routing: Disadvantages
 Packet header size grows with route length due to source routing
 Flood of route requests may potentially reach all nodes in the
network
 Care must be taken to avoid collisions between route requests
propagated by neighboring nodes
 insertion of random delays before forwarding RREQ

 Increased contention if too many route replies come back due to

nodes replying using their local cache
 Route Reply Storm problem

 Reply storm may be eased by preventing a node from sending

RREP if it hears another RREP with a shorter route

03/05/25 43
03/05/25 44
03/05/25 45
03/05/25 46
03/05/25 47
03/05/25 48
03/05/25 49
03/05/25 50
03/05/25 51
03/05/25 52
03/05/25 53
03/05/25 54
03/05/25 55
03/05/25 56
03/05/25 57
03/05/25 58
03/05/25 59
03/05/25 60
03/05/25 61
03/05/25 62
03/05/25 63
03/05/25 64
 VANETS(Vehicular Ad hoc
Networks)
 Special type of MANET in which moving
automobiles form the nodes of the network
 VANETs introduced for vehicles of police,fire
officers and ambulances for safe travelling on
the road

03/05/25 65
03/05/25 66
03/05/25 67
03/05/25 68
03/05/25 69
03/05/25 70
03/05/25 71
03/05/25 72
03/05/25 73
 MANET Vs VANET
 Collection of mobile nodes that communicate
with each other over bandwidth constrained
wireless links without infrastructure support

 VANETs are special category MANETs.

 Nodes are mobile in both VANETs and
MANETs

 VANET is constrained to the road topologies

and movement of nodes in MANET is more
03/05/25 74
 MANET Vs VANET

 If vehicles move over large distances at high

speeds, VANET undergoes fast topological
changes.
 Power is a major constraint but in VANET
battery power available in a vehicle is quite
adequate

03/05/25 75
03/05/25 76
03/05/25 77
03/05/25 78
03/05/25 79
03/05/25 80
03/05/25 81
03/05/25 82
03/05/25 83