Introducing Ad Hoc Networks

Nishi Kanta Das

Roll:- IT200117168
National Institute of Science & Technology
N
I
S
Presentation Outline
H
I  What is an Ad Hoc network?

K  Addressing schemes within Ad Hoc Networks

A
N  Ad Hoc network/Internet connectivity
T
A

D
A
S
National Institute of Science & Technology
N
I What is an Ad Hoc Network?
S
H Dictionary definition of ‘ad hoc’:
I Improvised and often impromptu

K
A
N Therefore…
T MANETs (Mobile Ad hoc NETworks) are
A networks which can come in and out of
existence without the need for any prior
D planning
A
S
National Institute of Science & Technology
N
I
Conventional Fixed Networks
S
H
I
IP Backbone
K composed of
A routers
N
T
A

D
A
S Basic model the Internet operates on today
National Institute of Science & Technology
N
I Conventional Cellular Systems
S
Simplified example from GSM
H
I BSS

K Other BSSs
A
BTS
N
T BSC MSC
BTS
A
BTS
D BTS = Base Transceiver Station
BSC = Base Station Controller
A BSS = Base Station Subsystem
S MSC = Mobile Switching Centre
National Institute of Science & Technology
N
I
S
H …communication is facilitated
I
by an infrastructure…
K
A
N …what if there is no
T
A infrastructure?…
D
A
S
National Institute of Science & Technology
N
I
How are MANETs different?
S
H
I

K
A
N
T
A

D
A
S
National Institute of Science & Technology
N
I How are MANETs different?
S
H
I

K
A
N
T
A

D
A
S
National Institute of Science & Technology
N
I
How are MANETs different?
S
H
I

K
A
N
T
A

D
A Nodes discover and maintain routes automatically
S
National Institute of Science & Technology
N
I Applications and Scenarios
S
Anytime communication needs to occur but a
H
I
facilitating infrastructure is not available
Conference/Lecture
Sensor Networks
K
A
N
T
A

D Military
A Search & Rescue
S Wireless Mesh Networks
National Institute of Science & Technology
N
I How do MANETs route data?
S
H
I

K
A
…using an ad hoc routing
N protocol…
T
A

D
A
S
National Institute of Science & Technology
N
I
The ad hoc Family Tree
S ad hoc Routing Protocols
H
I Pro-active Re-active

K
DSDV WRP AODV DSR LMR ABR
A
N
T CGSR TORA SSR
A Pro-active Re-active
actively seeks for routes seeks for routes only when required
D
DSDV = Destination-Sequenced Distance-Vector Routing, CGSR = Clusterhead Gateway Switch Routing, WRP
A = Wireless Routing Protocol, AODV = Ad Hoc On-Demand Distance Vector Routing, DSR = Dynamic Source
Routing, LMR = Lightweight Mobile Routing, TORA = Temporally Ordered Routing Algorithm, ABR =
S Associativity-Based Routing, SSR = Signal Stability Routing
National Institute of Science & Technology
N Pro-Active Example
I
Destination-Sequenced Distance-Vector
S
(DSDV) Routing
H
I Main characteristics
 Each node keeps a table of
routes to all other
K destinations in the network
A  Routing table updates are
N periodically transmitted
throughout the network to
T maintain consistency
A  Number of nodes in network
limited as overhead due to
D routing updates grows
rapidly with network size
A
S
National Institute of Science & Technology
N DSDV Routing
I Routing table for E: (simplified)
S Dest. Next Hop Metric Sequence Number
H A D 3 S406_A E F
I
B D 2 S128_B
K C D 2 S076_C
A D
D D 1 S050_D
N
F F 1 S392_F
T
A Routes are kept fresh by periodically B
sending UPDATE messages, which C
contain part of the above information.
D This can generate large amounts of
A traffic as the number of nodes A
increases
S
National Institute of Science & Technology
N Re-Active Routing Example
I
Dynamic Source Routing (DSR)
S
H Main characteristics
 A route is established when E F
I a node wants to transmit to a-b-d-e
another node (e.g. A with F)
K  A doesn’t know the route to
a-b-d a-b-d
A F, so it transmits a Route D
Request (RREQ)… a-b
N  Each node forwards the
T RREQ on all links except for a-b-d
A the one on which it was a B
received C
 The destination node picks
D the shortest path, and sends
A it in a Route Reply (RREP) A
S
National Institute of Science & Technology
N
I
Re-Active Routing Example
Dynamic Source Routing (DSR)
S
H  Node A receives the RREP
and caches the route E F
I  All intermediate nodes also
now know the route to node
K F, as well as the route to A
A D a-b-d-f
a-b-d-f
N Differences with DSDV
T  Routes are kept fresh
through acknowledgements,
A a-b-d-f B
not routing updates
 Initial latency when sending
C
D data as route needs to be
acquired first A
A
S
National Institute of Science & Technology
N
I Pro-active or Re-active -
S
H which method is best?
I

K …depends upon the intended

A
N
application/scenario…
T
A

D
A
S
National Institute of Science & Technology
N
I Summary
S  What is an Ad Hoc network?
H An infrastructure less network that can be formed without any prior planning
 Why?
I Infrastructure not available / has been destroyed. E.g. battle-time
scenario, remote search and rescue, sensor networks etc.
 How is data routed?
K
Using one of the many experimental protocols which can either pro-actively
A seek out routes, or can discover routes as and when they are required
N
T
A

D
A
S