Scribd
Upload
4 views14 pages

Routing in MANET

The document discusses the complexities of routing in Mobile Ad-hoc Networks (MANET) compared to traditional networks, highlighting challenges such as dynamic topology and battery constraints. It outlines various routing protocols, including Link State and Distance Vector protocols, and their respective advantages and disadvantages. Additionally, it categorizes unicast MANET routing protocols into proactive, reactive, and hybrid types, each with distinct characteristics and use cases.

Uploaded by

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

Routing in MANET

The document discusses the complexities of routing in Mobile Ad-hoc Networks (MANET) compared to traditional networks, highlighting challenges such as dynamic topology and battery constraints. It outlines various routing protocols, including Link State and Distance Vector protocols, and their respective advantages and disadvantages. Additionally, it categorizes unicast MANET routing protocols into proactive, reactive, and hybrid types, each with distinct characteristics and use cases.

Uploaded by

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

Routing in MANET

RAJASEKARAN AP/IT
Routing Challenges
❖ Packet Routing is much complex task in ad-hoc networks compare to
infrastructure based networks.
❖ Topology is keep on changing (Dynamic).
❖ Battery power constraints.
❖ Purpose of Routing:
➢ To find the best path for destination to deliver the packets from sender.
❖ What we have:
➢ Traditional routing protocol that is not suitable for ad-hoc’s.
➢ Each node must have the routing capability to keep the network operational.
Routing and MANET
❖ MANET Must Concentrate on these:
➢ Forwarding the packet to the next node (hop).
➢ While forwarding:
■ Ensure that packets moves towards its destination.
■ Number of hops/nodes minimized.
■ Delay Minimized.
■ Packet loss minimized.
■ Looping avoided.
Essentials of Traditional Routing Protocols
❖ Analysis of Traditional (Infrastructure Based) Routing Protocols.
❖ Specific changes need to be done for adapting these for ad-hoc.
❖ Popular protocols.
➢ Link State Protocols.
➢ Distance Vector Protocols.
❖ Both are need to compute the shortest path towards destination and
forward the packets to next node.
❖ Shortest path is computed according to some specific cost metric such
as number of hops in the route.
Link State Protocols (LSP)
❖ Link State states that connection between neighbour nodes and
router.
❖ Every routers has their knowledge about their direct neighbor and
flood these information in the network with link state
advertisements.
❖ Every routers has their Link State Packet Database (LSPDB) and stores
the link state advertisements.
❖ Each router creates the connectivity graph using LSPDB and
Dijkstra’s algorithm and finds the shortest path.
Downside of Link State Protocols (LSP)
❖ LSP’s exchanges a tiny information from each other.
❖ Each node actually constructs the tree using link information local
router act as root for the tree.
❖ Then router itself computes the best path to every node from itself.
❖ Frequent hello packets are exchanged to check the connectivity.
❖ No sharing of routing information with it’s neighbor.
❖ LS advertisements are sent whenever the connectivity changes.
❖ LS Advertisement contains only,
➢ The identity of the router originating the message.
➢ The identities of all it’s neighbours.
Distance Vector Protocols
❖ Distance Vectors (DV) stands for routing decisions made based on the distance
(number of hops to traverse) to the destination.
❖ Routes are advertised as Vectors (Distance, Direction).
❖ Each node know what is next hop for packet to be forwarded.
❖ DV is based on on the Bellman-Ford algorithm.
❖ It shares everything with its neighbors and computes the topology.
❖ Each router computes the distance based on their perspective and generates
the routing table and the table is broadcasted to the neighbors.
❖ Node updates the routing table form the information sent by neighbor and
forwards the changes to its neighbors.
❖ This process known as “Routing by Rumour”.
Downside Distance Vector Protocols
❖ Lack of knowledge about entire path to the destination.
❖ Router believes the information are all valid given by the neighbors it
causes the instability.
❖ DV Simply Calculates:
➢ Direction in (or the specific network interface over) which a packet should be
forwarded.
➢ Its own distance from the destination.
❖ Calculations of Distance done using two protocols
➢ Routing Information Protocol (RIP). (Node Count) (Cross Platform)
➢ Interior Gateway Routing Protocol (IGRP). (Node delay and Available Bandwidth)
(Cisco Proprietary).
Routing in MANET vs Traditional Networks

Traditional MANET
Nodes does not participate in routing. Every node acts as a router.

Most of the time topology is static. More dynamic topology.

Routing is easy task because Frequent routing table updates


infrequent routing table updates. required.

Simple IP scheme is enough Complex schemes takes a part


Types of Communication
❖ There are 3 types of communication,
➢ Unicast
■ One to One
➢ Multicast
■ One to Group
➢ Broadcast
■ One to All
Classifications of Unicast MANET Routing Protocols

Unicast MANET Routing


Protocols

Proactive (table - driven) Reactive (on - demand)


Hybrid routing protocols
protocols protocols
Proactive (Table - Driven)
❖ This is table driven protocol.
❖ Each node has the routing table that has the updated information
about the routes to all nodes.
❖ Small changes in the network requires routing table updates.
❖ Destination Sequenced Distance Vector Routing Protocol is example of
this.
❖ Each nodes knows the complete topology of the networks.
❖ Routing tables needs to be updated periodically.
❖ Lot’s of control messages are sent for route updation.
❖ If mobility of the node is high then this is not the best choice.
Reactive (On - Demand)
❖ It is on-demand.
❖ Routing table is not updated always.
❖ New routes are discovered and updated only when they actually
needed.
❖ Partial route information only available and it uses the flooding
technique to discover the routes.
❖ This is designed to reduce the overhead of larger networks.
❖ Highly efficient when the frequent updates are not needed.
❖ Examples:
➢ Dynamic Source Routing. (DSR)
➢ Ad-hoc on-demand distance vector routing (AODV)
Hybrid Routing Protocols
❖ It has the characteristics of both reactive and proactive protocols.
❖ This is designed for achieve scalability and get rid from discovery
overheads.
❖ For nearby nodes routes are maintained proactively.
❖ For far nodes routes are maintained reactively.
❖ It is zone based protocol.
❖ Example:
➢ Zone Routing Protocol.

You might also like