Q-Factor General Quiz-7th April 2024, Quiz Club NITW
Comprehensive survey on routing protocols for IoT
1. Comprehensive survey on routing
protocols for IoT
Presented by
Sulaiman Musaria KARIM
Wireless Computer Network
E-mail:- sulaiman_musaria@yahoo.com
2. Outlines
IoT: Definition .
What is a Routing Protocol?
IoT and Routing
The seven layers model
Routing Algorithm
Dynamic Routing Algorithms :-
Distance Vector
Distance Vector Algorithm
Link State Routing Algorithm
Traditional Link State Routing Algorithm
Some of Routing protocols
WSN clustering
LEACH protocol
3. IoT: Definition
The Internet of Things (IoT) is the network of
physical objects — devices, vehicles, buildings
and other items embedded with electronics,
software, sensors, and network connectivity —
that enables these objects to collect and
exchange data.
4. IoT
Is to enable things to be connected anytime, anyplace, with
anything and anyone.
Data are available to be used as part of the İoT technology
collecting, transmitting, storing, managing, and using data
are the layers of a İoT system.
The data transmission operations are performed by different
protocols located in various reference layers.
5. A routing protocol determines the optimal path (best
route) to transmit data from a source node to a
destination node through many intermediary nodes.
Routing is one of the critical task in Network , because
it is related to data transmission which is the principal
task of networking (information Exchange).
What is a Routing Protocol?
6. The existing routing algorithms in IoT are compared on
the basis of different parameters like power
consumption, security . Every routing protocol has its
own advantage depending upon the application where it
is used.
IoT and Routing
7. The seven layers model
Physical link
Data link layer
Network layer
Transport layer
Session layer
Presentation layer
Application layer
Physical link
Data link layer
Network layer
Transport layer
Session layer
Presentation layer
Application layer
Physical link
Data link layer
Network layer
Network A Network B
Routing - path finding from one end to the other
Routing occurs at layer 3- Network layer
8. Routing Algorithm
Design goals
• Optimality - compute the best route.
• Simplicity/low overhead - efficient with a minimum software
and utilization overhead
• Robustness/stability- perform correctly in the face of unusual
circumstances
• Rapid convergence- responds quickly when the network
changes
• Flexibility- accurately adapt to a variety of network
9. Dynamic Routing Algorithms
Modern computer networks generally use dynamic routing
algorithms rather than the static because static algorithms do
not take the current network load into account. Two dynamic
routing algorithms in particular are known:
1- Distance vector routing
2- Link state routing.
10. Routing Algorithm:
Distance Vector : RIP Protocol
Distance vector routing algorithms operate by having
each router maintain a table (i.e. a vector) giving the best
known distance to each destination and which line to use
to get there. These tables are updated by exchanging
information with other nodes .
11. Distance Vector Algorithm
Using hop count as a metric
Each router periodically sends a copy of routing table
to neighbors
Distance Vector Routing Update
Step by step from router to router
Slow convergence
12. Link State Routing Algorithm:- OSPF
The idea behind link state routing is simple and can be stated as five parts.
Each router must do the following:
1. Discover its neighbors and learn their network addresses.
2. Measure the delay or cost to each of its neighbors.
3. Construct a packet telling all it has just learned.
4. Send this packet to all other routers.
5. Compute the shortest path to every other router.
The complete topology and all delays are measured and distributed to every
router.
13. Traditional Link State Routing
Algorithm
Two components:
- Topology map distribution
- Local shortest path computation.
14. 1-Routing protocol for low-power and lossy networks
(RPL) is the standardized distance vector protocol and,
most commonly used in the IoT.
2-Channel-aware routing protocol (CARP) is another
routing protocol that is based on distributed networks
and designed for underwater communication. It is a
lightweight packet forwarding protocol and, hence, can
be applied to IoT systems.
Some of Routing protocols - 1
15. 3-The Routing Information Protocol ('RIP') is one of the oldest
distance-vector routing protocols which employ the hop count as
a routing metric. RIP prevents routing loops by implementing a
limit on the number of hops allowed in a path from source to
destination.
4-Open Shortest Path First Protocol (OSPF):- Have the same
qualities RPL protocol but it is work OSPF has the least cost of
transmission compared to RIP. When OSPF and RIP are
implemented together in a network, OSPF is chosen over RIP as
it has a lower administrative distance value than RIP. OSPF is
the best choice for larger networks and RIP can be limited to
simple and small networks.
Some of Routing protocols - 2
16. WSN Clustering
Clustering groups of nodes such that each node communicate
information only to cluster heads (CH) and then the CH communicates
the aggregated information to the BS
A cluster in WSN consists of a set of nodes connected together so that,
in many aspects, they can be viewed as a single system. Each node
performs its tasks of sensing, data collection, and data transmission
Clustering has been shown to improve WSN lifetime which is the most
important factor for evaluating the performance of a WSN
17. LEACH stands from the Low-Energy Adaptive Clustering
Hierarchy. It is a cluster-based routing algorithm with the
capability of auto-adaptation and auto-organization. The major
goal of LEACH is to improve WSN lifetime. Cluster heads are
chosen in ordered way after separating WSN within many
clusters.
LEACH is among the utmost leading energy optimization
algorithm in WSN routing
LEACH protocol
18. LEACH protocol based on clustering protocol with randomized
rotation of CHs was proposed. The proposed protocol used localized
coordination and was able to construct a scalable, robust, and dynamic
networks. It contains many advantages like it does not need any control
information, it saves energy, it is completely distributed and also have
many disadvantages like if cluster head dies then cluster become
useless, clusters are divided randomly. various improvements are done
on LEACH protocol and so there are various version of LEACH
protocol.
LEACH protocol