AD HOC AND WIRELESS SENSOR NETWORKS – EC8702

Session by
Dr/L.RAJA, ASP/ECE

1
Discussion in Previous session

 Adhoc wireless Internet

 Issues

2
Agenda of the session

 Routing
 Issues in Routing
 Classification of Routing Protocols

3
 Major Issues - Routing
Major challenges that a routing protocol designed for ad hoc wireless networks faces are

 Mobility of nodes
 Resource Constraints
 Error Prone channel state
 Hidden and Exposed Terminals

4
 Major Issues - Routing

Mobility of Nodes
 Dynamic topology due to movement of nodes - suffers frequent path breaks
 Disruption occurs
 Due to movement of intermediate nodes in the path or
 Due to movement of end nodes.
 Use of reliable links in wired networks (stationary) finds alternate routes during path breaks
 Convergence is very slow.
 Wired network routing protocols cannot be used in ad hoc wireless networks
 Mobility of nodes results in frequently changing network topologies.
 RP must be able to perform efficient and effective mobility management

5
 Major Issues - Routing

Bandwidth Constraint
 Abundant bandwidth in wired networks due to fiber optics
 Wireless network - radio band is limited
 Data rates are much less than what a wired network.
 Requires routing protocols use bandwidth optimally - overhead as low as possible.
 Limited bandwidth imposes constraint on routing protocols
 Bandwidth Wastage due to
 Frequent changes in topology,
 More control overhead
 Networks that require complete topology information - not be suitable for routing in ad hoc
wireless networking environment 6
 Major Issues - Routing
Error-Prone Shared Broadcast Radio Channel
Wireless links have time-varying characteristics - terms of link capacity and link-error probability.
 AWN RP interacts with MAC layer - to find alternate routes through better-quality links.
 Transmissions in AWN result in collisions of data and control packets.
 Attributed to hidden terminal problem
 It is required AWN routing protocols find paths with less congestion.

7
Major Issues - Hidden and Exposed Terminals
Hidden Terminals
• A sends to B, C cannot receive A
• C wants to send to B, C senses a “free” medium (CS fails)
• collision at B, A cannot receive the collision (CD fails)
• A is “hidden” for C

A B C
Exposed Terminals
• B sends to A, C wants to send to another terminal (not A or B)
• C has to wait, CS signals a medium in use
• but A is outside the radio range of C, therefore waiting is not necessary
• C is “exposed” to B
Routing

9
Characteristics of Routing Protocols
• It must be fully distributed

• It must be adaptive to frequent topology changes

• Route computation and maintenance must involve a minimum number of nodes

• It must be localized

• It must be loop-free and free from stale routes

• Number of packet collisions must be kept to a minimum

• It must converge to optimal routes with stable network topology

• It must optimally use scarce resources

• Every node in the network should try to store information

• It should be able to provide a certain level of quality of service 10

 Overview Routing Information Update

Ad Hoc Routing Protocols

Proactive Reactive
Table-Driven Demand-Driven

DSDV WRP
AODV LMR DSR ABR
CGSR
TORA SSR

11
Proactive vs Reactive
Proactive Reactive
Route from each node to every other node in Routes from Source to Destination only
the network

Routes are ready to use instantaneously Routes constructed when needed, higher
connection setup delay
Periodic route-update packets Route update when necessary

Large routing tables Small or No routing tables

12
 On-Demand Routing Protocols

Source Routing Hop-by-Hop Routing

ABR DSR
SSA AODV LMR LAR RDMAR

TORA

Elizabeth Royer and Chai Keong Toh, “A review of Current Routing Protocols for Ah Hoc Mobile Wireless Networks”, IEEE personal Communications April 1999 13
Source Routing vs Hop-by-Hop Routing
Source Routing Hop-By-Hop Routing
Data packets carry the complete addresses Data packets carry the address of the
from source to destination destination and the next hop

No routing table in intermediate nodes All nodes maintain localized routing tables

Not Scalable Scalable

14
General Properties
• Loop Free Routing
• Two Operation Phases
• Route Establishment
• Route Request  RouteRequest Packet, flooded by the Source node
• Route Reply  RouteReply Packet, returned to source node by Destination or
Intermediate node
• Route Maintenance
• Route Reconstruction
• Route Deletion

15
Protocols
• DSR: Dynamic Source Routing
• ABR: Associativity-Based Routing
• SSA: Signal Stability-Based Adaptive Routing Algorithm
• AODV: Ad Hoc On-Demand Distance Vector
• LAR : Location Aided Routing Protocol
• RDMAR: Relative Distance Micro-Discovery Ad Hoc Routing
• LMR: Light-weight Mobile Routing
• TORA: Temporally Ordered Routing Algorithm
• ARA: Ant-colony-based Routing Algorithm

16
Ad Hoc On-Demand Distance Vector Routing (AODV)

• Source Routing (DSR, ABR and SSA) is good for smaller networks due
to large data packet overhead
• AODV:
• Hop by Hop basis
• No need to include the full path in the data packet
• Update Neighborhood information through periodic beacons

21
AODV– Route Discovery
• Source Node broadcast RouteRequest packet
• Each intermediate node gets a RouteRequest do the following steps:
• Establish a reverse link to node it received the RouteRequest from
• If request received before  discard
• If route to destination is available and up-to-date  return RouteReply using the reverse
link
• Otherwise  rebroadcast the RouteRequest
• Destination node respond with RouteReply using the reverse link

22
AODV - Route Discovery

E
B
D

S C

A
G

RouteRequest

23
AODV - Route Discovery

E
B
D

S C

A
G

Reverse Path Setup

RouteRequest

24
AODV - Route Discovery

E
B
D

S C

A
G
RouteRequest Dropped
Reverse Path Setup
RouteRequest
25
AODV - Route Discovery

E
B
D

S C

A
G
RouteReply
Reverse Path Setup
RouteRequest
26
AODV - Route Discovery

E
B
D

S C

A
G

Forward Route Setup

RouteReply
Reverse Path Setup 27
AODV - Route Discovery

E
B
D

S C

A
G

Forward Route Setup

RouteReply
Reverse Path Setup 28
AODV - Route Discovery

E
B
D

S C

A
G

Forward Route Setup

RouteReply
Reverse Path Setup 29
AODV – Route Maintenance
• When a node detects a link failure, it sends special RouteReply with
infinity distance
• RouteReply is propagated to source node
• Source node initiates a new RouteRequest

30
AODV – Route Maintenance

RouteReply
E
RouteReply B
D

S C

A
G

31
AODV Concerns
• Route Reply from intermediate nodes can lead to inconstant routes
 Stale Cache
• Periodic beaconing cost

32
 Quiz/Activity/Q&A
Identify the topic which is not a primary responsibility of MC protocol in  adhoc wireless network
a. Distributed arbitration for the shared channel for transmission of packets
b. Time synchronization
c. Hidden and exposed terminal problem
d.It must converge to optimal routes once the network topology becomes stable. the convergence must be quick

Challenge for routing protocol in ad-hoc networks. When a group of nodes are required to contact, which
a. Reliability type of the following routing is useful?
b. Mobility a. Multicast
c. Availability b. Unicast
d. Security c. Broadcast
d. Forecast

Proactive Routing protocol is——– Protocol which report routing information only when there
a. Distance Vector Routing Protocol is a change in the topology of the network.
b. Link state Routing Protocol a. d-hoc On-demand Distance Vector
c. Table driven routing protocol. b. Distance-vectors Routing
d. on-demand routing protocol c. Zone Routing Protocol
d. Dynamic Source Routing
33
Session Handler Details
Dr.L.Raja
raja.lece@sece.ac.in
76672410124

34