Advanced Computer Networks

CS ZG525/ CSI ZG525/ ES ZG526/ SS ZG525

Prof. ANIMESH GIRI

BITS Pilani
Pilani Campus [email protected]
Advanced Computer Networks
CS ZG525/ CSI ZG525/ ES ZG526/ SS ZG525
Module 5

Lead Instructor: Prof. ANIMESH GIRI ([email protected])

 BITS Pilani
Pilani | Dubai | Goa | Hyderabad

Introduction to Wireless Ad-hoc

Networks
I n th i s s e g m e n t
• What are wireless ad-hoc networks
• Characteristics of wireless ad-hoc networks
• Routing in wireless ad-hoc networks
• Characteristics of routing protocol for wireless ad-hoc networks
Wi re l e s s Ad - h o c Ne t wo r k s
• What are wireless ad-hoc networks
• Applications
– Military operations
– Emergency operations
– Wireless mesh networks
– Wireless sensor networks
• Examples: smart classroom, back of the rack temp monitoring, environmental
monitoring, glacier monitoring, swarm robotics, earthquake monitoring, Industry
4.0 and so on
Wi re l e s s Ad - h o c Ne t wo r k s
• Characteristics of applications using wireless ad-hoc networks
– Infeasibility of setting up infrastructure
– Cost
– Reliability, Efficiency
– Security
– Point to multi-point and multicasting capabilities
– Low latency
Ro u t i n g i n Wi r e l e s s Ad - h o c Ne t wo r k s
• Routing protocols used in wired networks cannot be used as is in wireless ad-hoc
networks
– Dynamic topology
– Bandwidth constraints
– Energy constraints
– No infrastructure to support centralized administration
• So how is routing done in wireless ad-hoc networks?
Ro u t i n g i n Wi r e l e s s Ad - h o c Ne t wo r k s
What are the issues in designing a routing protocol for wireless ad-hoc networks?

• Dynamic topology
– Mobility due to node movements
– Frequent path breaks
– Network partitioning
– Inefficient path repair mechanisms (slow convergence)
Ro u t i n g i n Wi r e l e s s Ad - h o c Ne t wo r k s
What are the issues in designing a routing protocol for wireless ad-hoc networks?

• Bandwidth constraints
– Limited radio band
– Less data rate
– Overhead for adjusting to topology changes
– Conflicting requirements: manage topology changes yet be bandwidth efficient
Ro u t i n g i n Wi r e l e s s Ad - h o c Ne t wo r k s
What are the issues in designing a routing protocol for wireless ad-hoc networks?

• Wireless link characteristics

– Error prone
– Nodes compete for channel access
– Collisions
– Hidden and exposed node problems
• Resource constraints
– Limited battery and processing power for the nodes
Ch a ra c t e r i s t i c s o f a n I d e a l Ro u t i n g P r o t o c o l
fo r Wi re l e s s Ad - h o c Ne t wo rk s
• Fully distributed
• Adaptive to frequent topology changes
• Minimum connection set up time
• Localized
• Loop free
• Avoid stale routes
• Fast convergence
• Optimum utilization of resources such as bandwidth, battery and processing
power
• Ability to support QoS
• Scalable
Su m m a ry
• What are wireless ad-hoc networks, applications
• Characteristics of wireless ad-hoc networks
• Routing in wireless ad-hoc networks
• Characteristics of routing protocol for wireless ad-hoc networks
 BITS Pilani
Pilani | Dubai | Goa | Hyderabad

Introduction to Wireless Ad-hoc

Routing Protocols
I n th i s s e g m e n t
• Characteristics of routing protocols for wireless ad-hoc networks
• Classification of routing protocols for wireless ad-hoc networks
– Routing information update mechanism
– Use of temporal information for routing
– Use of topology information
– Resource utilization
Ch a ra c t e r i s t i c s o f a n I d e a l Ro u t i n g P r o t o c o l f o r
Wi re l e s s Ad - h o c Ne t wo r k s
• Fully distributed
• Adaptive to frequent topology changes
• Minimum connection set up time
• Localized
• Loop free
• No stale routes
• Fast convergence
• Optimum utilization of resources such as bandwidth, battery and processing
power
• Ability to support QoS
• Scalable
Cl a ss i f i c a t i o n o f Ro u t i n g P r o t o c o l s f o r Wi r e l e s s
Ad -h o c Ne t wo r k s

• Routing information update mechanism

– Proactive, reactive

• Use of temporal information for routing

– Past, present & future states

• Use of topology information

– Flat, hierarchical

• Resource utilization
Pro t o c o l s b a s e d o n Ro u t i n g I n f o rm a t i o n
Up d a t e Me c h a n i s m
• Proactive routing protocols
– Table-driven routing protocols
– Maintain routing information in routing tables
– Routing information is flooded in the networks
– Path-finding algorithm
– +: low delay of route setup process
– -: high bandwidth, low scalability, high storage
– Eg: Destination Sequenced Distance Vector routing protocol (DSDV)
Pro t o c o l s b a s e d o n Ro u t i n g I n f o rm a t i o n
Up d a t e Me c h a n i s m
• Reactive routing protocols
– On-demand routing protocols
– Obtain the necessary path only when required
– +: low control overhead
– -: high delay in route setup
– -: low scalability
– Eg: Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing
(AODV) protocols
Pro t o c o l s b a s e d o n Ro u t i n g I n f o rm a t i o n
Up d a t e Me c h a n i s m
• Hybrid routing protocols
– Combination of table-driven and on-demand routing protocols
– +: fast link establishment
– +: less overhead compared to proactive & reactive routing protocols
– -: high storage & processing requirements compared to reactive routing protocols
– Eg: Zone Routing Protocol (ZRP)
Pro t o c o l s b a s e d o n Us e o f Te m p o r a l
I n fo r m a t i o n
• Past temporal information
– Uses past status of links or status of links at the time of routing to make routing
decisions
– Using available information at the time of making the routing decisions
– +: Optimal routes will be used since information about the current availability of links
with shortest path algorithm are used
– -: If the link breaks during data transmission, route reconfiguration has to happen
– Eg: DSDV
Pro t o c o l s b a s e d o n Us e o f Te m p o r a l
I n fo r m a t i o n
• Future temporal information
– Future status of links are predicted
– Uses expected future status of the links to make routing decisions
– Eg: remaining battery charge, predicted location
– +: Less probability of link breaks
– -: More computation overhead
– Eg: Flow Oriented Routing Protocol (FORP)
Pro t o c o l s b a s e d o n Ro u t i n g To p o l o g y
• Flat topology routing protocols
– Flat addressing scheme
– Globally unique addressing mechanism for nodes
– Each node has its own unique global address -> all nodes are peers
– Routing and data packets are transmitted across any number of nodes in the network
– More suitable for networks with small no: of nodes
– Eg: DSR, AODV
Pro t o c o l s b a s e d o n Ro u t i n g To p o l o g y
• Hierarchical topology routing protocols
– Logical hierarchy based on node clusters
– Clusters are formed based on a common scope (eg: hop distance to each other)
– Elected cluster head coordinates between the different nodes in the cluster
– Requires hierarchical addressing scheme
– Traffic inside/among clusters is better scheduled
– Eg: Cluster-Head Gateway Switch Routing Protocol (CGSR)
Pro t o c o l s b a s e d o n t h e Ut i l i z a t i o n o f
Sp e c i f i c Re s o u rc e s
• Power-aware routing
– Minimize consumption of resource such as battery power

• Geographical information assisted routing

– Improve the routing performance
– Reduce control overhead
Su m m a ry - Cl a s s i f i c a t i o n o f Ro u t i n g
Pro t o c o l s ( 1 / 2 )
Su m m a ry - Cl a s s i f i c a t i o n o f Ro u t i n g
Pro t o c o l s ( 2 / 2 )
Su m m a ry
• Characteristics of routing protocols for wireless ad-hoc networks
• Classification of routing protocols for wireless ad-hoc networks
– Routing information update mechanism
– Use of temporal information for routing
– Use of topology information
– Resource utilization
 BITS Pilani
Pilani | Dubai | Goa | Hyderabad

DSDV Protocol
I n th i s s e g m e n t
• Overview of DSDV protocol
De st i n a t i o n S e q u e n c e d Di s t a n c e Ve c t o r
Ro u t i n g P ro t o c o l ( DS DV )
• Proactive, table-driven routing protocol
• Enhanced from the distributed Bellman-Ford algorithm
• Each node maintains routing information for all known destinations
• Routing information is updated periodically
• Table updates are propagated with increasing sequence number tags
– Loop prevention
– Addresses count-to-infinity problem
– Faster convergence
DSDV
• Exchange routing tables between neighbors at regular intervals
• Two types of updates
– Incremental updates
• Takes a single network PDU
• Triggered when there is no significant change in the local topology
– Full dumps update
• Takes multiple network PDUs
• Triggered when local topology changes significantly or incremental updates
require more than one network PDU
Ro u t e Es t a b l i s h m e n t i n DS DV

Source: Ad Hoc Wireless Networks:

Topology Graph of the Network Routing Table for Node 1 Architectures and Protocols by B.S. Manoj
and C. Siva Ram Murthy
Ro u t e Ma i n t e n a n c e i n DS DV

Source: Ad Hoc Wireless Networks:

Architectures and Protocols by B.S. Manoj
and C. Siva Ram Murthy
DSDV Ad v e r t i s e m e n t s
• Advertise to each neighbor own routing information
– Destination address
– Metric = no: of hops to destination
– Destination sequence number
• Rules to set sequence number information
– On each advertisement increase own destination sequence number
– Use only even numbers
– If a node is not reachable any more, increase sequence no: of this node by 1 (odd) and
set metric = ∞
Ex a m p l e – DS DV Ta b l e s
DSDV Ro u t e Ad v e r t i s e m e n t s
DSDV ( Ne w No d e )
DSDV ( Ne w No d e )
DSDV – P ro s & Co n s
• Advantages
– Routes to all destinations are readily available at every node at all times

• Disadvantages
– Excessive control overhead during high mobility
– Node must wait for a table update message initiated by the destination node - This
causes stale routing information at nodes
– Maintains routes which are never used
– Not effective for large no: of mobile nodes
– Topology changes make DSDV unstable until update packets propagate through the
network
Su m m a ry
• DSDV protocol and its working, advantages and disadvantages
 BITS Pilani
Pilani | Dubai | Goa | Hyderabad

DSR Protocol
I n th i s s e g m e n t
• Overview of DSR routing protocol
Dy n a m i c S o u rc e Ro u t i n g ( DS R)
• On-demand routing protocol
– https://www.ietf.org/rfc/rfc4728.txt
• Designed to eliminate periodic table update messages to restrict bandwidth
consumption
• Beacon-less -> no hello packets
• Nodes cache the routes
• Two phases
– Route discovery
– Route maintenance
DSR
• Route Discovery
– To find a path
– Source node floods RouteRequest (RREQ) messages with TTL specified
– Destination generates RouteResponse (RREP) message
– Intermediate nodes can also generate RouteResponse message if a route to the
destination is in its cache

• Route Maintenance
– For path maintenance
– Detecting network topology changes
– Generating RouteError messages if a route to a destination becomes invalid
Ro u t e Es t a b l i s h m e n t i n DS R

Source: Ad Hoc Wireless Networks: Architectures and Protocols

by B.S. Manoj and C. Siva Ram Murthy
Ro u t e Ma i n t e n a n c e i n DS R
• Route maintenance is performed only when the route is in use
• Error detection
– How DSR checks status of links
• Layer 2 acks
• Passive acks
• DSR specific software ack
– When route break is detected, send RouteError message to original sender to initiate
new route discovery
Ro u t e Ma i n t e n a n c e i n DS R

Source: Ad Hoc Wireless Networks: Architectures and Protocols

by B.S. Manoj and C. Siva Ram Murthy
DSR – Sa l i e n t f e a t u r e s ( 1 / 2 )
• No periodic activity – completely on-demand
• Support for caching of multiple routes to a destination
• Asymmetric routes & unidirectional links – in wireless, a link between 2 nodes
may not work well in both directions
– Differing transmit powers, sources of interference etc.
• Blacklist
• RREP – could be from route cache, blacklist or new route discovery
• RREP is unicast unless route discovery is initiated
• Designed for MANETs with about 200 nodes & high levels of mobility
• Source routing – allows sender to select and control the routes used for its
packets
• Guarantees loop free operation
DSR – Sa l i e n t f e a t u r e s ( 2 / 2 )
• RREQ is a local broadcast packet
• RREQ contains a record listing the address of each intermediate node through
which this RREQ has been forwarded
• RREP – nodes look up its route cache for a route back to the initiator of the route
discovery
• Methods to reduce overhead
– Use reverse routes
– Overhear other transmissions and populate cache
– Exponential back off algorithm to limit the rate at which it initiates new route discoveries
for the same target
• Automatic route shortening
DSR – Pr o s & Co n s
• Advantages
– No need of updating routing tables
– Reduced control overhead because of caching in intermediate nodes
– Beacon-less

• Disadvantages
– Route Maintenance does not repair a broken link
– There is a small time delay at the beginning of a new connection
Su m m a ry
• DSR protocol, advantages & disadvantages
 BITS Pilani
Pilani | Dubai | Goa | Hyderabad

AODV Protocol
I n th i s s e g m e n t
• Overview of AODV routing protocol
Ad -h o c On De m a n d Di s t a n c e Ve c t o r
Ro u t i n g P ro t o c o l ( AODV )
• On-demand routing protocol
– https://www.ietf.org/rfc/rfc3561.txt
• Message types
– Route Requests (RREQ)
– Route Replies (RREP)
– Route Errors (RERR)
– Hello (for link status monitoring)
• Difference between DSR and AODV
– DSR uses source routing -> data packet carries the compete path to be traversed
– AODV stores the next hop information corresponding to each flow for data packet
transmission
AODV
• RouteRequest (RREQ) packet
– SrcID, DestID, SrcSeqNum, DestSeqNum, BcastID, TTL
– Generated by source node
– When an intermediate node receives an RREQ packet, it does one of the following:
• If it has a valid route to the destination, prepares a RREP message
• If not, stores the pre-node address and BcastID & forwards the packet – Forward path setup

• RouteReply (RREP) packet

– A node receiving the RREP packet will record the information as the next hop towards
the destination
– Reverse path setup
AODV
• Flooding for control packet delivery
• Control packets are used to discover routes
• If a node has forwarded a RREQ from a source for a destination, it does not
forward it again from another neighbour
• Possibility of control packets not getting delivered due to collision
• + Simple & reliable
• - Overhead
• - Reliability depends on Layer 2 characteristics also
AODV
• Route discovery
• Reverse path setup
• Forward path setup
• Reverse path used to send RREP back to the source
• Here are a couple of questions to ponder:
– What is the difference between a RREP sent by a destination and a RREP
sent by an intermediate node?
– What happens when multiple RREPs for a given destination is received at the
source?
AODV – Ma i n t a i n i n g De s t i n a t i o n S e q No s
A destination node increments its own sequence number in two circumstances:
• Immediately before a node originates a route discovery, it must increment its own
sequence number. This prevents conflicts with previously established reverse
routes towards the originator of a RREQ
• Immediately before a destination node originates a RREP in response to a
RREQ, it must update its own sequence number to the maximum of its current
sequence number and the destination sequence number in the RREQ packet
AODV – Ma i n t a i n i n g De s t i n a t i o n S e q No s
• Destination Sequence Number
– Sequence number of the destination address entry in the routing table
– Updated whenever a node receives new information about the sequence number from
RREQ, RREP, or RERR messages

• A node may change the sequence number in the routing table entry of a
destination only if:
- it is itself the destination node, and offers a new route to itself, or
- it receives an AODV message with new information about the sequence number for a
destination node, or
- the path towards the destination node expires or breaks
Ro u t e Es t a b l i s h m e n t i n AODV

Source: Ad Hoc Wireless Networks: Architectures and Protocols by B.S. Manoj and C. Siva Ram Murthy
Ro u t e Ma i n t e n a n c e i n AODV

Source: Ad Hoc Wireless Networks: Architectures and Protocols by B.S. Manoj and C. Siva Ram Murthy
ADOV – P r o s & Co n s
• Advantages
– Establishes routes on demand
– Destination sequence numbers are used to find the latest path to destination
– Low connection setup time

• Disadvantages
– Intermediate node can lead to inconsistent routes
– Beacon-based
– Heavy control overhead
DSR v s AODV ( 1 / 2 )
• Packet size:
– Uniform in AODV
– Non-uniform in DSR because of source routing
• Hello packets:
– Present in AODV
– Not present in DSR
• Caching routes
– AODV does not cache routes but routes have a lifetime after which routes expire
– DSR caches routes
DSR v s AODV ( 2 / 2 )
• No: of routes
– AODV maintains only one route between source and destination
– DSR maintains multiple routes in the route cache per destination
• Support for reverse path
– Supported in AODV
– Not supported in DSR
• Unlike DSR, AODV limits its presence advertisement only to its closest
neighbours (i.e., one-hop with TTL=1)
Su m m a ry
• AODV – working, advantages and disadvantages