Ad Hoc and Wireless Sensor Network

By
Mr. Dharani kumar, M.E.,
ECE, Gojan School Of Business and technology
UNIT-I: Syllabus
Ad Hoc Networks- Introduction and Routing Protocols

 Elements of Ad hoc Wireless Networks,

 Issues in Ad hoc wireless networks,
 Example commercial applications of Ad hoc networking,
 Ad hoc wireless Internet,
 Issues in Designing a Routing Protocol for Ad Hoc
Wireless Networks,
 Classifications of Routing Protocols,
 Table Driven Routing Protocols - Destination Sequenced
Distance Vector (DSDV), On–Demand Routing protocols
–Ad hoc On–Demand Distance Vector Routing (AODV).
Adhoc is a latin word which mean “for this”
Small clip on Adhoc Networks:
Question:
Differentiate WSN and Ad Hoc Network?
Wireless Sensor Networks
WSN
Ad-Hoc Networks Wireless Sensor Networks
WSN
Advantages of Ad Hoc Networks
Applications of Ad Hoc N/Ws:
Applications of Ad Hoc N/Ws:
Cellular vs Ad Hoc networks
Question:
Differentiate Adhoc and Hotspot?

Hotspot
ISSUES IN ADHOC WIRELESS NETWORKS
 Medium access scheme- Hidden and Exposed node problem
 Routing
 Multicasting
 Transport layer protocol
 Pricing scheme
 Quality of service provisioning
 Self-organization
 Security
 Energy management
 Addressing and service discovery
 Scalability
 Deployment considerations
 Media Access Scheme:
 One of the issues in designing Media Access Control (MAC) protocol is Hidden and
Exposed node problem

Hidden Node Problem: Exposed Node Problem:

Nodes that are hidden (or not reachable) from the

sender of a data transmission session, but are The nodes that are in the transmission range of the
reachable to the receiver of the session. In such sender of an on-going session, are prevented from making a
cases, the hidden terminal can cause collisions at the transmission.
receiver node.
AD HOC WIRELESS INTERNET:
AD HOC WIRELESS INTERNET:

Gateway nodes in the

ad hoc wireless
Internet are the entry
points to the wired
Internet.
Adhoc Protocols:
MAC protocols and Routing Protocols
Based on routing Based on Topology
information update Information
mechanism Organization
Traditional ad-hoc routing protocols
Table-driven routing protocol – DSDV (cont.)
Example: Routing table for Node 1
15
Dest NextNode Dist seqNo
14
2 2 1 22
13 3 2 2 26
11 4 5 2 32
12
5 5 1 134
6 6 1 144
10 9
8 7 2 3 162
8 5 3 170
9 2 4 186
6
4
10 6 2 142
7 11 6 3 176
5
12 5 3 190
13 5 4 198
3 14 6 3 214
1
2 15 5 4 256
Table-driven routing protocol – DSDV (cont.)

Routing table for Node 1

15 Dest NextNode Dist seqNo
2 2 1 22
14
13
3 2 2 26
11 4 5 2 32
12
5 5 1 134
6 6 1 144
10
7 2 3 162
8 9
8 5 3 170
9 2 4 186
6
10 6 2 142
4 7
11 5 4 180
5
12 5 3 190
13 5 4 198
3 14 6 3 214
1
2 15 5 4 256
Route Requests in AODV
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

48
 Route Requests in AODV
Y
Broadcast transmission

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

Represents transmission of RREQ

49
Route Requests in AODV
Y

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

Represents links on Reverse Path

50
 Reverse Path Setup in AODV
Y

Z
S E
F
B
C M L
J
A G
H D
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
51
Reverse Path Setup in AODV
Y

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

52
Reverse Path Setup in AODV
Y

Z
S E
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 RREQ
53
Forward Path Setup in AODV
Y

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

Forward links are setup when RREP travels along

the reverse path

Represents a link on the forward path 54

 Route Maintenance
3´
RERR RERR 3
1 2
S D

The link from node 3 to D is broken as 3 has

moved away to a position 3´.

Node 2 sends a RERR message to 1 and 1

sends the message in turn to S.
S initiates a route discovery if it still needs the
route to D.
55
56
Questions?