Unit-3 MANET Routing Protocols
Unit-3 MANET Routing Protocols
Dr.R.Srivel AP/CSE
Destination - Sequenced Distance Vector
Routing
❖ It is a table driven (proactive) protocol.
❖ It extended from distance vector routing for Bellman-Ford Algorithm.
❖ Main advancement done for routing loop avoidance using sequencing scheme.
❖ Routing information always readily available.
❖ Each node maintains the routes for all known destination.
❖ Routing information updated periodically.
DSDV Working
❖ Sequence numbering system is used to allow mobile nodes to distinguish the blocked
routes from new one.
❖ Updated routing table is shared and updated for table consistency.
❖ Lot of table exchange and updates leads to poor utilization of the network.
❖ To overcome this problem DSTV uses two routing update packets.
➢ Full Dump
■ It contains all the routing data and it can require multiple network packet data unit (NPDU).
■ Route labeled with most recent sequence numbers and used.
DSDV Working
N1 N1 N1 0 S1-321 T4-001
N1 N2 N2 1 S2-218 T4-001
N1 N3 N2 2 S3-043 T4-002
N1 N4 N4 1 S4-092 T4-001
N1 N5 N4 2 S5-163 T4-002
DSDV Steps
❖ Each router (node) in the network collects node information of all its neighbors.
❖ After gathering information node determines shortest path to the destinations.
❖ Based on the information new routing table is generated.
❖ Routers broadcasts the tables to it’s neighbors.
❖ Neighbors will recomputes the routes for their respective tables.
❖ This process continues till the routing information becomes stable.
Dynamic Source Routing (DSR) Protocol
❖ It is developed for small network size 5 to 10 hops and nodes have minimum
mobility.
❖ It is on-demand (reactive) protocol.
❖ Node does not compute all routes readily.
❖ When the route is actually needed then the route is discovered.
❖ Packets routing is based on source organization that is each packet is created with full
route information discovered by DSR. so each node can find next hop easily.
❖ Route information is updated in route cache. Whenever node finds the new route it
will added to cache.
❖ Network overhead is minimized.
Dynamic Source Routing (DSR) Protocol
❖ DSR Works in two steps
1. Route Discovery
2. Route Maintenance
DSR Route Discovery
❖ It helps the dynamically discover when the route is needed in ad-hoc network.
❖ When a packet is ready to sent it checks for the route in routing cache, if available it uses the
route or else it initiates the route discovering mechanisms.
❖ Route request packet is broadcasted in the networks.
❖ Routes request packet contains source address, id, route record to record the route while
reaching the destination.
❖ Each node either forwards (if it is not a destination ) the route request packets or reply with route
replay packet if it is a destination or it knows the destination.
❖ Replay packet is piggybacked with all routing information and sent back to route requester.
DSR Route Discovery
N1-N2 Destination
N2 N1-N2-N5
N1 N5 N8
Source N1-N3-N4-N7
N1-N3-N4
N1
N4 N1-N3-N4
N7
N1 N1-N3
N3
N1-N3-N4 N6 N1-N3-N4-N6
DSR Route Reply
N1-N2-N5-N8 Destination
N2 N1-N2-N5-N8
N1-N2-N5-N8 N5 N8
N1
N4
Source
N7
N3 N6
DSR Route Maintenance
❖ When the known route is broken then route maintenance is initiated.
❖ Route maintenance is monitoring the correct operation of the route and taking the corrective
actions.
❖ When node send a packet and sense that route is broken then the packet is responded with route
error message to the source.
❖ It deletes the broken route from the routing cache and if it has alternative routes to the
destination it will resend the packet in that route or else it will initiate route discovery process
again.
Ad-Hoc On - Demand Distance Vector
(AODV)
❖ The route discovery and route maintenance are very similar to DSR.
❖ It uses the hop-by-hop routing, sequence numbers and beacons.
❖ If a node generates the route request message is forwarded by intermediate nodes.
❖ Intermediate nodes also learns the reverse route from the source while forwarding the packets.
❖ When the route request reaches the destination and then it replied with no of hops to reach the
destination.
❖ All the nodes will participate the forwarding the reply to source and learns the forward route to
the destination.
❖ Large header is avoided the AODV when compared to DSR.
Zone Routing Protocol
❖ The Zone Routing Protocol is Hybrid Protocol (ZHP).
❖ It uses the routing zone and this is similar to cluster.
❖ Within a zone it uses the table driven protocols.
❖ If a destination node it out from the zone then it will act as on-demand protocols.
❖ When a node want to send a packet to other zone nodes the packet sent to border node.
❖ Border node activate the reactive protocols and forwards the request to other zone.
❖ Border node act as proxy for two zones.
Zone Routing Protocol
Advantages:
● Reduces the control traffic produced by periodic flooding of routing
information packets.
● Decrease the latency caused by route discovery in reactive routing
protocols.
● Reduces the wastage of bandwidth.
Disadvantages:
● Since each node has higher level topological information, Memory
requirement is greater.
● Large overlapping of routing zones.
Multicast Routing Protocols for MANET
❖ Efficient multicasting protocols are,
➢ Protocols that minimize the unnecessary packet transmissions.
➢ Minimized energy consumption.
❖ MANET is difficult to handle with multicast protocols.
❖ Problems,
➢ Nodes Mobility.
➢ Interferences.
➢ Noise.
❖ Popular MANET multicast protocols are,
➢ Tree-based protocol.
➢ Mesh-based protocol.
Multicast Routing Protocols for MANET
❖ Tree-based protocol
➢ Single path establishment in multicast group.
➢ It requires minimum number of copies per packet to send along the branches of the tree.
➢ Bandwidth efficient.
➢ Problems
■ If mobility increases, link failure will trigger the reconfiguration of entire tree.
■ When many source,
● Node must maintain shared tree.
● Losing path optimality.
● Maintaining multiple trees leads to storage and control overhead.
➢ Example:
■ Multicast Ad-Hoc On-Demand Distance Vector (MAODV) Protocol.
Multicast Routing Protocols for MANET
❖ Mesh-based protocol
➢ It establishes mesh paths that connect the sources and destinations.
➢ More resistive to link failures and mobility.
➢ Problem:
■ Multiple Copies of same packet are disseminated in the mesh.
■ Reduced packet delivery and Increased control overhead under highly mobile
conditions.
➢ Example:
■ On-demand Multicast Routing Protocol (ODMRP).
Security Issues in
MANET
Security Issues in MANET
❖ MANET is mobile in nature so this causes many problems,
❖ Identifying and fixing the problem is too difficult when compared to traditional
networks.
❖ Due to the dynamic topology the several security attack can be done in physical
layers itself an intruder can cause,
➢ Jamming.
➢ Overloading.
➢ Paralyzing.
Of the network.
○ It is standardized as 802.11p which provides short range communication with low latency.
Communication in VANET
VANET and Road Accidents
Crowdsourcing in VANET
MANET and VANET
MANET VANET
Collection of mobile node that communicate with It is special kind of MANET. Nodes on the move
each other without having any infrastructure and can establish an ad-hoc with other vehicle and
as well stand alone roadside units (RSU) for
communication.
Movement of nodes in MANET is more random. Node mobility is constrained to the road topologies.
We can’t expect fastest topological changes in VANET goes fastest topological changes because of
MANET. speed of vehicle.
Power is major constraint in MANET Vehicle can power VANET more effectively.
Moving speed does not consider for MANET Moving speed of the node has design effect on
design. VANET