Scribd
Upload
32 views17 pages

GSR Routing Protocol Presentation

Uploaded by

Swati Joshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views17 pages

GSR Routing Protocol Presentation

Uploaded by

Swati Joshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

GSR ROUTING PROTOCOL

Presenters
Aayush Kumar, Siddharth Dangwal, Swati
Joshi
M.Tech First Semester
Mobile Computing
MCS-102
Introduction
• It is a proactive /table driven routing protocol. It actually extends the link
state routing of the wired networks. It is based on Dijkstra's routing
algorithm.

• GSR is based upon fundamental concepts of link state routing.

• In LSR, one of the nodes floods out a single routing table information to
its neighbors and those neighbors flood out that table to further nodes.
This process table is received by all the nodes throughout the network.

• But in case of GSR, the routing table of a particular node is broadcasted to


its immediate neighbors only. Then the initial table of those neighboring
nodes are updated. These updated tables are further broadcast one by
one and this process broadcasts their tables to each node in the network.
Concept
• GSR protocols use and maintain three tables for every node individually.
These tables are:

• 1. Distance table: This table contains the distance of a node from all the
nodes in the network.
• 2. Topology Table: This table contains the information of link state data
along with sequence number which can be used to determine when the
information is updated last.
• 3. Next hope table: Next hop table will contain the information about
the immediate neighbor of a particular node.

These tables are updated on every step and ensure that each node
receives correct information about all nodes including their distances.
Working and example
• GSR broadcasts the routing tables to its immediate neighbor
rather than flooding it to all the nodes as link state protocol
does.
• Consider a network of 4 having a distance of "1" on each of its
edges.
Working
• Steps 1. For node 'X': Firstly three tables will maintain the
distance table, topology table and next hop tables. This same
process will be done for the rest of the nodes too.
Working
• Steps 2. Broadcasting of all the tables will be done to all the immediate
neighbors of "X" i.e. "Y" and "Z".

• Steps 3. These tables are updated at "X", "Y" and "Z" nodes respectively.

• Steps 4. Same will be done for node "Y". After first updation from "X",
node "Y" will broadcast the tables to its immediate neighbors i.e. "X"
and "T" and those tables will be done for "T" and "Z" also.

• Step 5. Once done, all the nodes "X", "Y", "Z", and "T" will be having the
updated routing tables containing distances from each, with the help of
which an optimal path can be chosen if data needs to be transferred
from one node to another.
Working

• For “Y”
Working
• For “Z”

Step 6. Now broadcasting of topology tables of "X" will take place


to its neighbor i.e. "Y" and "Z". Updated tables will be like.
Step 7. Similarly, these tables are further updated with topology
tables of "Y", "Z", and "T" as done in case of "X".
Advantages
• Minimizes routing overhead.
• Improves scalability for larger networks.
• Provides quick route recovery in dynamic
environments.
Disadvantages
• High memory usage for storing global
topology.
• Increased processing time for route
determination.
• Not ideal for highly sparse or dense networks.
Applications
• Military communication systems.
• Emergency rescue operations.
• Vehicular ad-hoc networks (VANETs).
Comparison with Other Protocols
• Compared to reactive protocols, GSR reduces
route discovery time.
• Higher memory and computation
requirements than AODV or DSR.
• Suitable for networks with moderate mobility.
Protocol Steps
1. Node initialization with topology data.
2. Exchange of periodic updates.
3. Route selection using the global topology
table.
4. Update propagation on topology change.
Route Discovery
• Uses proactive approach to maintain topology.
• Reduces delay compared to on-demand
protocols.
• Ensures a quick response to data transmission
requests.
Simulation Results
• Simulation studies show reduced latency in
GSR compared to reactive protocols.
• Higher packet delivery ratio in dynamic
topologies.
• Increased efficiency in medium-sized
networks.
Real-Life Use Cases
• Disaster management networks.
• Inter-vehicular communication systems.
• Remote sensing and telemetry networks.
Conclusion
• GSR routing protocol offers a proactive
approach for MANETs.
• Balances routing efficiency with scalability.
• Suitable for moderate mobility scenarios with
real-time requirements.

You might also like