Scribd
Upload
94 views

Tim 7 - Routing Protocols For Ad Hoc Wireless Networks PDF

This document provides an overview of routing protocols for ad hoc wireless networks. It discusses the challenges in designing routing protocols for these dynamic networks and classifies routing protocols as table-driven, on-demand, or hybrid. Table-driven protocols maintain up-to-date routing tables through periodic broadcasts while on-demand protocols discover routes only when needed. Common table-driven protocols discussed are DSDV, WRP, CGSR, and STAR. On-demand protocols covered include DSR, AODV, LAR, ABR, and SSA. Hybrid protocols take aspects of both approaches. The presentation was given by three students - Randy Mukti, Karim Amirullah, and Haikal Sh

Uploaded by

muktirandy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
94 views

Tim 7 - Routing Protocols For Ad Hoc Wireless Networks PDF

This document provides an overview of routing protocols for ad hoc wireless networks. It discusses the challenges in designing routing protocols for these dynamic networks and classifies routing protocols as table-driven, on-demand, or hybrid. Table-driven protocols maintain up-to-date routing tables through periodic broadcasts while on-demand protocols discover routes only when needed. Common table-driven protocols discussed are DSDV, WRP, CGSR, and STAR. On-demand protocols covered include DSR, AODV, LAR, ABR, and SSA. Hybrid protocols take aspects of both approaches. The presentation was given by three students - Randy Mukti, Karim Amirullah, and Haikal Sh

Uploaded by

muktirandy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 39

Routing Protocols For Ad Hoc

Wireless Networs
Randy Mukti - 20180801243
Karim Amirullah - 20160801020
Haikal Shiddiq - 20160801021

April 15, 2019


Today’s Presenters

Randy Mukti Karim Amirullah Haikal Shiddiq


20180801243 20160801020 20160801021
Teknik Informatika Teknik Informatika Teknik Informatika
Agenda
1 Introduction

Issue In Designing A Routing


2 Protocol for Ad Hoc Wireless
Classifications Of Routing
3 Protocols

4 Table-Driven Routing Protocols

5 On-Demand Routing Protocols

6 Hybrid Routing Protocols


Introduction
Ad Hoc Networks

• An ad hoc network is a temporary connection between computers and devices used for a
specific purpose, such as sharing documents during a meeting or playing multiplayer
computer games

• An ad hoc networks is made up of multiple “nodes” connected by “links”


What we have in ad hoc environment:
Dynamically changing topology
• The network topology (the physical connectivity of the communication network) in
such a network may keep changing randomly

Absence of fixed infrastructure and centralized administration

Bandwidth constrained wireless links

Multihop Communication

Link loss is one of the biggest problem for routing.


Issue in Designing A Routing
Protocol For Ad Hoc Wireless
Networks
Challenges of Routing Protocols in Ad Hoc Networks
Movement of nodes:
• Path breaks
• Partitioning of a network
• Inability to use protocols developed for fixed networks

Bandwidth is a scarce resource


• Inability to have full information about topology
• Control overhead must be minimized

Bandwidth constrained wireless links


• Nodes compete for sending packets
• Collisions

Energy-constrained nodes
• Loss of routing
Design Goals
• Must be scalable
• Must be fully distributed, no central, coordination
• Must be adaptive to topology changes caused by movement of nodes
• Route computation and maintenance must involve a minimum number of nodes
• Must be localized, global exchange involves a huge overhead
• Must be loop-free
• Must be effectively avoid stale routes
• Must converge to optimal routes very fast
• Must optimally use the scare resources: bandwidth, battery power, memory,
computing
• Should provide QoS guarantees to support time-sensitive traffic
Classification of Routing
Protocols
Routing protocols for ad-hoc wireless networks can be
classified based on:
• Routing information update mechanism
• Usage of temporal information (e.g. cached routes)
• Usage of topology information
• Usage of specific resources (e.g. GPS)
Ad hoc networks
Based on routing information update mechanism
• Proactive (table-driven) routing protocols
• Reactive (on-demand) routing protocols
• Hybrid protocols
Based on usage of temporal information
• Based on past temporal information
• Based on future temporal information

Based on the routing topology


• Flat topology routing protocols
• Hierarchial topology routing protocols

Routing based on utilization of specific resource


• Power-aware routing
• Geographical information assisted routing
Table-driven Routing Protocols
Table-Driven Routing Protocols

These protocols are extensions of the wired network routing protocols. They maintain the
global topology information in the form of tables at every node. These tables are updated
frequently in order to maintain consistent and accurate network state information.
Table-driven / Proactive Protocol
• Proactive: maintain routing information independently of need for
communication
• Update messages send throughout the network periodically or when
network topology changes.
• Low latency, suitable for real-time traffic
• Bandwidth might get wasted due to periodic update
Table-driven Routing Protocols
Protocol Consideration
• Destination sequenced distance vector routing protocol (DSDV)
• Wireless routing protocol (WRP)
• Cluster head gateway routing protocol (CGCR)
• Source-tree adaptive routing protocol (STAR)

Common advantages and shortcoming of these protocols:


• +: low delay of route setup process: all routes are immediately available
• -: high bandwidth requirements: updates due to link loss leads to high control
overhead
• -: low scalability: control overhead is proportional to the number of nodes
• -: high storage requirements: whole table must be in memory
Destination sequenced distance vector routing protocol
(DSDV)
Modification of the Bellman-Ford algorithm where each node maintains:
• The shortest path to destination
• The first node on this shortest path
This protocol is characterized by the following:
• Routes to destination are readily available at each node in the routing table (RT)
• RTs are exchanged between neighbors at regular intervals
• RTs are also exchanged when significant changes in local topology are observed by
a node
RT updates can be of two types:
• Incremental updates:
- take place when a node does not observe significant changes in a local topology
• Full dumps:
- take place when significant changes of local topology are observed
Wireless Routing Protocol (WRP)
Each node maintains the following
• Distance table (DT) containing network view of the neighbors of the node:
- distance and predecessor node for all destinations as seen by each neighbor
• Routing Table (RT) containing view of the network for all known destination including:
- the shortest distance to destination
- the predecessor node
- the successor node
- flag indicating the status of the path (correct, loop, null)
• Link cost table (LCT) containing cost-related information including:
- number of hops to reach destination (cost of the broken link is Ꝏ
- number of update periods passed from the last successful update of the link
• Message retransmission list (MRL) containing counter for each entry:
- the counter is decremented after every retransmission of the update message
Cluster Head Gateway Switch Routing Protocol (CGSR)
It is characterized by the following:
• Nodes are organized into cluster, each having an elected cluster-head
• Cluster head provides a coordination within its transmission range (single hop)
• Token-based scheduling is used within a cluster for sharing bandwidth between
nodes
• All communication pass through the cluster head
• Communication between cluster is done using the common nodes (gateway with two
interfaces)
Source-tree adaptive routing protocol (STAR)
There are two protocols with different aims:
• Least overhead routing approach (LORA) :
- minimize control overhead irrespective of optimality
• Optimum routing approach (ORA):
- provide optimal routes irrespective of the control overhead
The STAR protocol operates as follows:
• Each node is required to:
- send an update message to its neighbors during initialization
- send update messages about new destinations, chances of routing loops, costs of
paths
• Every node broadcasts its source-tree information
- wireless links is used by the node in its preferred path to destination
• Every node builds its partial graph of topology based on:
- its adjacent links with neighbors, source-tree broadcast by neighbors
On-Demand Routing Protocols
On-Demand Routing Protocols

Unlike the table-driven routing protocols, on-demand routing protocols execute the path-
finding process and exchange routing information only when a path is required by a node
to communicate with a destination. This section explores some of the existing on-demand
routing protocols in detail.
On-Demand / Reactive Routing Protocols
• Reactive: discover route only when you need it
• Saves energy and bandwidth during inactivity
• Can be bursty -> congestion during high activity
• Significant delay might occur as a result of route
discovery
• Good for light loads, collapse in large loads
Reactive Routing Protocols
Reactive routing protocol is also known as on demand routing protocol. In this protocol route is
discovered whenever it is needed Nodes initiate route discovery on demand basis. Source node
sees its route cache for the available route from source to destination if the route is not available
then it initiates route discovery process. The on- demand routing protocols have two major
components
Route Discovery:
In this phase source node initiates route discovery on demand basis. Source nodes consults its
route cache for the available route from source to destination otherwise if the route is not present it
initiates route discovery. The source node, in the packet, includes the destination address of the
node as well address of the intermediate nodes to the destination
Route Maintenance
In this phase source node initiates route discovery on demand basis. Source nodes consults its
route cache for the available route from source to destination otherwise if the route is not present it
initiates route discovery. The source node, in the packet, includes the destination address of the
node as well address of the intermediate nodes to the destination
Reactive routing protocols
These protocols find paths to destination only when needed (on-demand) to transmit a
packet.
We consider:
• Dynamic source routing protocol (DSR)
• Ad hoc on-demand distance vector routing protocol (AODV)
• Location aided routing (LAR)
• Associativity-based routing (ABR)
• Signal stability-based adaptive routing protocol (SSA)
These protocols have the following advantages and shortcomings:
• -: high delay of route setup process: routes are established on-demand
• +: small control overhead: no route updates
• -: low scalability: no route updates
• -: low storage requirements: only needed routes are in cache
Hybrid Routing Protocols
Hybrid Routing Protocols
• Proactive for neighborhood, Reactive for far away (Zone
Routing Protocol, Haas group)
• Proactive for long distance, Reactive for neighborhood
(Safari)
• Attempts to strike balance between the two
Hybrid Routing Protocols
These protocols maintain topology information up to m hops in tables.
We consider:
• Zone routing protocols (ZRP)
• Zone-based hierarchial link state routing protocol (ZHLS)
What are inherent shortcomings and advantages:
• +: fast link establishment
• +: less overhead as compared to table-driven and reactive protocols
• -: high storage and processing requirement as compared to reactive protocols

Note: a compromise between proactive and reactive protocols


Zone Routing Protocols (ZRP)
Zone-based hierarchial link state routing protocol
The repair of broken links is as follows:
• source is notified about the link failures
• if there are multiple gateways with the required zone, packet if
forwarded via one of those
• if no multiple gateways, packet are forwarded to other zones and
then to the required zone
Terimakasih

You might also like