1. Hierarchical Routing Protocol :
Hierarchical Routing is the method of routing in networks that is based on hierarchical addressing. Most transmission control protocol, Internet protocol (DCPIP). Routing is based on two level of hierarchical routing in which IP address is divided into a network, person and a host person. Gateways use only the network a person tell an IP data until gateways delivered it directly.
It addresses the growth of routing tables. Routers are further divided into regions and they know the route of their own regions only. It works like a telephone routing.
City, State, Country, Continent.
2. Flat Routing Protocol :
In flat routing protocol, if any node needs to transmit data, it first searches for a valid route to the base station and then transmits the data. Nodes to the base station may drain their energy quickly.
They are the flat networks in which every incoming packet is sent out on every outgoing line except the one it arrived on. Vast numbers of duplicate packets are generated. It is good for small networks and offers high reliability.
Routing Information Protocol, Interior Gateway Routing Protocol.
Difference between Hierarchical and Flat Routing Protocol :
|Hierarchical Routing Protocol||Flat Routing Protocol|
|It is simple but non-optimal routing.||Routing can be made optimal but with an added complexity.|
|It is a Channel Reservation-based scheduling.||It is a Contention-based scheduling.|
|Collisions is avoided.||Collisions over-head in attendance.|
|Overhead of cluster information all over the network.||Routes form only in the regions that have data for transmission.|
|Fair channel allocation.||Fairness is not guaranteed.|
|In this, Energy Dissipation is consistent.||In this, Energy Dissipation depends on traffic patterns.|
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.