DYNAMIC SOURCE ROUTING (DSR)
Download as PPTX, PDF0 likes1,461 views
Dynamic Source Routing uses route discovery to find routes between nodes. When a node receives a route request (RREQ) message, if it is the destination it returns a route reply (RREP) with the accumulated route record to the sender. If it is an intermediate node, it discards the RREQ if it has the same ID or finds its own address in the route, otherwise it appends its address to the route record and propagates the RREQ to neighbors to continue finding a path to the destination.
1 of 6
Downloaded 68 times
Recommended
AODV protocol
AODV protocolShanka Mahakumbura
油
1) The document describes the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. AODV is a reactive protocol that discovers routes on-demand using a route discovery process.
2) When a node needs to send a packet to an unknown destination, it broadcasts a route request (RREQ) to its neighbors. Neighbors set up reverse paths and rebroadcast the RREQ until it reaches the destination node.
3) The destination or intermediate nodes with a route can send a unicast route reply (RREP) back to the source node using the reverse path. This sets up a forward path from source to destination for data packets.DSDV VS AODV 
DSDV VS AODV Senthil Kanth
油
DSDV is a proactive routing protocol that uses periodic routing table exchanges and sequence numbers to avoid loops. AODV is a reactive protocol based on DSDV that uses on-demand route discovery with broadcast RREQ and unicast RREP messages to find routes, and maintains routing tables at nodes instead of in packet headers like DSR. Both protocols aim to quickly adapt to dynamic links with low overhead.Dynamic source routing
Dynamic source routingAshraf Uddin
油
DSR is a source routing protocol for wireless ad hoc networks. It uses source routing whereby the source specifies the complete path to the destination in the packet header. Route discovery is done through route request broadcasts, and routes are cached for future use. Route maintenance is done through acknowledgements; if a link breaks, a route error is sent back to the source. Simulation results showed high packet delivery ratios even with high node mobility. DSR performs well for dynamic wireless networks.AODV (Ad hoc On-demand Distance Vector) VS AOMDV (Ad hoc On-demand Multipath ...
AODV (Ad hoc On-demand Distance Vector) VS AOMDV (Ad hoc On-demand Multipath ...Ann Joseph
油
The document discusses Ad hoc On-demand Multipath Distance Vector (AOMDV), which is a multipath extension of the AODV routing protocol for mobile ad hoc networks. AOMDV discovers multiple loop-free and disjoint paths between source and destination nodes in a single route discovery to improve fault tolerance. It provides benefits like lower end-to-end delay, higher throughput, and reduced route discovery operations compared to AODV, which is a single path routing protocol.Ad hoc On-demand Distance Vector (AODV) Routing Protocol by Ashok Panwar
Ad hoc On-demand Distance Vector (AODV) Routing Protocol by Ashok PanwarAshok Panwar
油
The document discusses the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. AODV is a reactive routing protocol designed for use in mobile ad hoc networks. It establishes routes using a route discovery process initiated when a node requires a route to a destination. This process uses route request and route reply messages to discover routes. AODV also maintains these routes by periodically broadcasting hello messages and responding to link failures via route error messages. The document provides details on AODV's routing table structure, message types, route discovery and maintenance processes.Zone Routing Protocol
Zone Routing Protocolnitss007
油
ZRP divides routing into intrazone and interzone routing. Intrazone routing uses a proactive approach to route packets within a node's routing zone. Interzone routing uses a reactive approach where the source node sends route requests to peripheral nodes when the destination is outside its zone. The optimal zone radius depends on factors like mobility and query rates, with smaller radii preferred for higher mobility. ZRP aims to reduce routing overhead through techniques like restricting floods and maintaining multiple routes.Dsdv
Dsdvprakash06
油
DSDV is a proactive routing protocol that extends distance-vector routing for mobile ad hoc networks. It adds sequence numbers to routing table updates to prevent routing loops, and uses damping to hold updates for short-lived changes. Each node periodically broadcasts its full routing table or incremental updates to neighbors. When multiple routes to a destination are received, the route with the highest sequence number is chosen.Routing in Manet
Routing in Manetshiujinghan
油
This document discusses routing protocols for mobile ad-hoc networks (MANETs). It introduces several routing protocols including proactive (table-driven) protocols like Destination-Sequenced Distance Vector (DSDV), reactive (on-demand) protocols like Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), and hybrid protocols like Zone Routing Protocol (ZRP) that use both proactive and reactive approaches. For each protocol, it provides a brief overview of the routing approach and algorithm. It also compares the characteristics of proactive, reactive and hybrid routing protocols.Simulation & comparison of aodv & dsr protocol
Simulation & comparison of aodv & dsr protocolPrafull Johri
油
This document summarizes and compares two reactive routing protocols - AODV and DSR. It discusses how NS2 was extended to simulate wireless networks and the two protocols. AODV uses route discovery to find paths, maintains route tables, and can locally repair broken links. DSR also uses route discovery but source routes are carried in packet headers. While AODV has lower initial packet loss, DSR performance improves over time, so either protocol can be used for longer simulations.PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
油
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.Adhoc routing protocols
Adhoc routing protocolsSenthil Kanth
油
Routing Protocols for Ad-Hoc Networks. This is a book for Ad-hoc On-Demand Distance Vector Routing
&
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. November 2011,
Authors : Giorgos Papadakis & Manolis SurligasDsdv
DsdvAbhishek Kesharwani
油
DSDV is a proactive routing protocol that uses destination sequence numbers to ensure loop-free routing in mobile ad hoc networks. Each node maintains a routing table with destination addresses, next hops, metrics, and sequence numbers. Nodes periodically broadcast their full routing tables, and also broadcast updates immediately after changes to avoid loops and converge quickly. DSDV addresses issues with traditional distance vector routing through the use of sequence numbers and by damping route fluctuations.Comparison between aodv and olsr protocol
Comparison between aodv and olsr protocolMehedi
油
The document compares the AODV and OLSR routing protocols for mobile ad hoc networks. AODV is a reactive protocol that establishes routes on demand, while OLSR is a proactive protocol that maintains routes to all nodes. OLSR generally has lower latency than AODV but higher overhead. Both protocols elect multipoint relays to reduce flooding. AODV uses less bandwidth but requires route discovery, while OLSR maintains all routes continuously.Performance analysis of AODV And OLSR
Performance analysis of AODV And OLSRMitesh Thakore
油
AODV is a reactive routing protocol for mobile ad hoc networks. It uses route discovery and maintenance to dynamically discover and maintain routes. Route discovery uses route request (RREQ) and route reply (RREP) messages to find routes between nodes. Route maintenance uses route error (RERR) messages to notify nodes of link breaks. Each node maintains a routing table with next hop and destination information.Secure Routing with AODV Protocol for MANET by Ashok Panwar
Secure Routing with AODV Protocol for MANET by Ashok PanwarAshok Panwar
油
This presentation discusses securing the AODV routing protocol for mobile ad hoc networks. It reviews three approaches: 1) Using public key cryptography and group session keys to authenticate nodes and encrypt routing packets. 2) Using intrusion detection and response models to identify compromised nodes based on abnormal routing behavior. 3) The Secure AODV (SAODV) protocol which aims to provide source authentication, neighbor authentication, message integrity, and access control to address vulnerabilities like message tampering, dropping, and replays. Experimental results are compared for SAODV and traditional AODV.Dynamic source routing in ad hoc wireless networks
Dynamic source routing in ad hoc wireless networkshuda2018
油
The document summarizes dynamic source routing in ad hoc wireless networks. It describes how the protocol uses source routing to determine routes between communicating hosts, with route discovery initiated on demand and route maintenance using hop-by-hop acknowledgements. Key optimizations include full use of route caches, piggybacking data on route requests, reflecting shorter routes, and improved error handling. The dynamic source routing protocol reduces overhead compared to conventional routing protocols and better handles the dynamic topology changes in ad hoc wireless networks.Aodv slide final
Aodv slide finalguest53dedc9
油
Ad-hoc On-Demand Distance Vector (AODV) is a routing protocol for wireless ad-hoc networks that allows nodes to communicate with each other by discovering routes on demand using a broadcast route request and unicast route reply process, where each node maintains a routing table with the next hop and number of hops to each known destination. AODV limits routing overhead by maintaining routes only as long as they are needed and repairing broken routes using route error and hello messages.AODV Protocol
AODV ProtocolDarshan Rathi
油
This document provides a literature review of research papers on detecting and preventing blackhole attacks in the AODV routing protocol for mobile ad hoc networks (MANETs). It summarizes 9 papers that propose various techniques like using sequence numbers, watchdog mechanisms, and route confirmation messages to identify malicious nodes and increase security. The document outlines the key ideas, results, and potential future work from each paper to improve performance and security against blackhole attacks in AODV routing.Lecture 11 14. Adhoc routing protocols cont..
Lecture 11 14. Adhoc routing protocols cont..Chandra Meena
油
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.Routing protocols
Routing protocolsN.Jagadish Kumar
油
This slides will be very useful for engineering college students,Based on the Syllabus from Anna university chennai.AODV routing protocol
AODV routing protocolVarsha Anandani
油
The document discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.Wireless routing protocols
Wireless routing protocolsbarodia_1437
油
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.Global state routing
Global state routingTata Consultancy Service Limited
油
Global State Routing (GSR) maintains a global knowledge of network topology like link state routing but avoids inefficient flooding. Each node periodically exchanges its link state table only with neighbors, not the entire network. This reduces overhead compared to link state routing. GSR nodes use Dijkstra's algorithm on the accumulated link state information to compute optimal paths locally without global flooding.Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2
Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2Sushant Kushwaha
油
The document discusses several routing algorithms for mobile ad-hoc networks: TORA is a reactive protocol that reacts to changes and link reversals in highly dynamic networks; CGSR is a hierarchical and proactive protocol where routing tables are pre-built so paths are immediately available; flat routing table based protocols pre-build routing tables showing all paths while optimized link state protocols only update required routing data to reduce overhead.Cluster based routing protocol
Cluster based routing protocolSudhansu Dash
油
The document summarizes the Cluster Based Routing Protocol (CBRP) for mobile ad hoc networks. CBRP divides the network into clusters with cluster heads that maintain routing information and perform routing functions. Key aspects of CBRP include periodic hello messages to track neighbors, identifier-based clustering, on-demand route discovery using cluster heads, source routing with loose and strict routes, local route repair instead of re-routing, and advantages like lower overhead and higher delivery rates compared to other protocols. CBRP is well-suited for situations requiring mobile network connectivity like disaster recovery or military operations.Routing protocol
Routing protocolAmzadKhn
油
This document discusses MANET routing protocols and compares AODV and DSR protocols. It provides an overview of ad hoc networks and their key characteristics like being decentralized and relying on participating nodes to forward data. It then describes the main categories of ad hoc routing protocols - proactive (table-driven) and reactive (on-demand). The document dives deeper into AODV and DSR protocols, explaining their path discovery, maintenance and other mechanisms. The key differences noted are that DSR can handle uni-directional and bi-directional links while both protocols employ on-demand routing and broadcast discovery but use different approaches for route information storage and link failure handling.Media Access and Internetworking
Media Access and InternetworkingN.Jagadish Kumar
油
This slide will be very useful for Engineering college students ,based in the Anna university syllabus chennai.Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1
Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1Sushant Kushwaha
油
DSR deploys source routing, reacting dynamically to changes by maintaining only active routing addresses from source to destination. AODV is also a reactive protocol that maintains only active routes, with each node keeping a next-hop routing table. Route entries expire after a time limit. AODV adopts destination sequence numbers to ensure loop-free and up-to-date routes.DSR Protocol
DSR Protocol@zenafaris91
油
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed for use in wireless ad-hoc networks without existing infrastructure. DSR allows networks to self-organize and self-configure. It uses two main mechanisms: route discovery determines the optimal transmission path between nodes, while route maintenance ensures the path stays optimal and loop-free as network conditions change.AODV protocol
AODV protocolRaj Sikarwar
油
AODV Protocol, Detailed Discussion of Black Hole attack and A method to cure Black Hole Attack in the network.More Related Content
What's hot (20)
Simulation & comparison of aodv & dsr protocol
Simulation & comparison of aodv & dsr protocolPrafull Johri
油
This document summarizes and compares two reactive routing protocols - AODV and DSR. It discusses how NS2 was extended to simulate wireless networks and the two protocols. AODV uses route discovery to find paths, maintains route tables, and can locally repair broken links. DSR also uses route discovery but source routes are carried in packet headers. While AODV has lower initial packet loss, DSR performance improves over time, so either protocol can be used for longer simulations.PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
油
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.Adhoc routing protocols
Adhoc routing protocolsSenthil Kanth
油
Routing Protocols for Ad-Hoc Networks. This is a book for Ad-hoc On-Demand Distance Vector Routing
&
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. November 2011,
Authors : Giorgos Papadakis & Manolis SurligasDsdv
DsdvAbhishek Kesharwani
油
DSDV is a proactive routing protocol that uses destination sequence numbers to ensure loop-free routing in mobile ad hoc networks. Each node maintains a routing table with destination addresses, next hops, metrics, and sequence numbers. Nodes periodically broadcast their full routing tables, and also broadcast updates immediately after changes to avoid loops and converge quickly. DSDV addresses issues with traditional distance vector routing through the use of sequence numbers and by damping route fluctuations.Comparison between aodv and olsr protocol
Comparison between aodv and olsr protocolMehedi
油
The document compares the AODV and OLSR routing protocols for mobile ad hoc networks. AODV is a reactive protocol that establishes routes on demand, while OLSR is a proactive protocol that maintains routes to all nodes. OLSR generally has lower latency than AODV but higher overhead. Both protocols elect multipoint relays to reduce flooding. AODV uses less bandwidth but requires route discovery, while OLSR maintains all routes continuously.Performance analysis of AODV And OLSR
Performance analysis of AODV And OLSRMitesh Thakore
油
AODV is a reactive routing protocol for mobile ad hoc networks. It uses route discovery and maintenance to dynamically discover and maintain routes. Route discovery uses route request (RREQ) and route reply (RREP) messages to find routes between nodes. Route maintenance uses route error (RERR) messages to notify nodes of link breaks. Each node maintains a routing table with next hop and destination information.Secure Routing with AODV Protocol for MANET by Ashok Panwar
Secure Routing with AODV Protocol for MANET by Ashok PanwarAshok Panwar
油
This presentation discusses securing the AODV routing protocol for mobile ad hoc networks. It reviews three approaches: 1) Using public key cryptography and group session keys to authenticate nodes and encrypt routing packets. 2) Using intrusion detection and response models to identify compromised nodes based on abnormal routing behavior. 3) The Secure AODV (SAODV) protocol which aims to provide source authentication, neighbor authentication, message integrity, and access control to address vulnerabilities like message tampering, dropping, and replays. Experimental results are compared for SAODV and traditional AODV.Dynamic source routing in ad hoc wireless networks
Dynamic source routing in ad hoc wireless networkshuda2018
油
The document summarizes dynamic source routing in ad hoc wireless networks. It describes how the protocol uses source routing to determine routes between communicating hosts, with route discovery initiated on demand and route maintenance using hop-by-hop acknowledgements. Key optimizations include full use of route caches, piggybacking data on route requests, reflecting shorter routes, and improved error handling. The dynamic source routing protocol reduces overhead compared to conventional routing protocols and better handles the dynamic topology changes in ad hoc wireless networks.Aodv slide final
Aodv slide finalguest53dedc9
油
Ad-hoc On-Demand Distance Vector (AODV) is a routing protocol for wireless ad-hoc networks that allows nodes to communicate with each other by discovering routes on demand using a broadcast route request and unicast route reply process, where each node maintains a routing table with the next hop and number of hops to each known destination. AODV limits routing overhead by maintaining routes only as long as they are needed and repairing broken routes using route error and hello messages.AODV Protocol
AODV ProtocolDarshan Rathi
油
This document provides a literature review of research papers on detecting and preventing blackhole attacks in the AODV routing protocol for mobile ad hoc networks (MANETs). It summarizes 9 papers that propose various techniques like using sequence numbers, watchdog mechanisms, and route confirmation messages to identify malicious nodes and increase security. The document outlines the key ideas, results, and potential future work from each paper to improve performance and security against blackhole attacks in AODV routing.Lecture 11 14. Adhoc routing protocols cont..
Lecture 11 14. Adhoc routing protocols cont..Chandra Meena
油
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.Routing protocols
Routing protocolsN.Jagadish Kumar
油
This slides will be very useful for engineering college students,Based on the Syllabus from Anna university chennai.AODV routing protocol
AODV routing protocolVarsha Anandani
油
The document discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.Wireless routing protocols
Wireless routing protocolsbarodia_1437
油
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.Global state routing
Global state routingTata Consultancy Service Limited
油
Global State Routing (GSR) maintains a global knowledge of network topology like link state routing but avoids inefficient flooding. Each node periodically exchanges its link state table only with neighbors, not the entire network. This reduces overhead compared to link state routing. GSR nodes use Dijkstra's algorithm on the accumulated link state information to compute optimal paths locally without global flooding.Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2
Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2Sushant Kushwaha
油
The document discusses several routing algorithms for mobile ad-hoc networks: TORA is a reactive protocol that reacts to changes and link reversals in highly dynamic networks; CGSR is a hierarchical and proactive protocol where routing tables are pre-built so paths are immediately available; flat routing table based protocols pre-build routing tables showing all paths while optimized link state protocols only update required routing data to reduce overhead.Cluster based routing protocol
Cluster based routing protocolSudhansu Dash
油
The document summarizes the Cluster Based Routing Protocol (CBRP) for mobile ad hoc networks. CBRP divides the network into clusters with cluster heads that maintain routing information and perform routing functions. Key aspects of CBRP include periodic hello messages to track neighbors, identifier-based clustering, on-demand route discovery using cluster heads, source routing with loose and strict routes, local route repair instead of re-routing, and advantages like lower overhead and higher delivery rates compared to other protocols. CBRP is well-suited for situations requiring mobile network connectivity like disaster recovery or military operations.Routing protocol
Routing protocolAmzadKhn
油
This document discusses MANET routing protocols and compares AODV and DSR protocols. It provides an overview of ad hoc networks and their key characteristics like being decentralized and relying on participating nodes to forward data. It then describes the main categories of ad hoc routing protocols - proactive (table-driven) and reactive (on-demand). The document dives deeper into AODV and DSR protocols, explaining their path discovery, maintenance and other mechanisms. The key differences noted are that DSR can handle uni-directional and bi-directional links while both protocols employ on-demand routing and broadcast discovery but use different approaches for route information storage and link failure handling.Media Access and Internetworking
Media Access and InternetworkingN.Jagadish Kumar
油
This slide will be very useful for Engineering college students ,based in the Anna university syllabus chennai.Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1
Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1Sushant Kushwaha
油
DSR deploys source routing, reacting dynamically to changes by maintaining only active routing addresses from source to destination. AODV is also a reactive protocol that maintains only active routes, with each node keeping a next-hop routing table. Route entries expire after a time limit. AODV adopts destination sequence numbers to ensure loop-free and up-to-date routes.Viewers also liked (17)
DSR Protocol
DSR Protocol@zenafaris91
油
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed for use in wireless ad-hoc networks without existing infrastructure. DSR allows networks to self-organize and self-configure. It uses two main mechanisms: route discovery determines the optimal transmission path between nodes, while route maintenance ensures the path stays optimal and loop-free as network conditions change.AODV protocol
AODV protocolRaj Sikarwar
油
AODV Protocol, Detailed Discussion of Black Hole attack and A method to cure Black Hole Attack in the network.Mobile Ad hoc Networks
Mobile Ad hoc NetworksJagdeep Singh
油
Mobile ad hoc networks (MANETs) are formed spontaneously by wireless devices without any preexisting infrastructure. Nodes in a MANET are free to move and dynamically change the network topology. MANETs have applications in military operations, emergency response, education, and home/office use. Key challenges include dynamic topology, limited resources, and lack of centralized management. Media access control protocols address issues like hidden and exposed terminals. Routing protocols can be proactive (table-based) or reactive (on-demand) to find routes between nodes in the changing network.Attacks in MANET
Attacks in MANETSunita Sahu
油
This document discusses security issues and attacks in mobile ad hoc networks (MANETs). It provides an introduction to MANETs and their characteristics. It outlines the general objectives of analyzing flooding attacks on MANETs and preventing such attacks for networks with high node mobility. It describes common attacks on MANETs such as flooding attacks, blackhole attacks, wormhole attacks, and Byzantine attacks. The document also discusses security mechanisms for MANETs including preventive cryptography-based approaches and reactive intrusion detection system approaches. It stresses the need for comprehensive security solutions to deal with the diverse attacks that are facilitated by the open and dynamic nature of MANETs.Link state routing protocol
Link state routing protocolAung Thu Rha Hein
油
Link-state routing protocols use Dijkstra's algorithm to calculate the shortest path to all destinations based on a link-state database containing the full network topology. Each router runs the same algorithm locally to determine the optimal path. Key aspects include link-state advertisements to share connectivity information, the topological database to store network maps, and shortest path first calculations to derive routes. Common link-state protocols are OSPF and IS-IS. They provide fast convergence and scalability but require more resources than distance-vector protocols.Ppt of routing protocols
Ppt of routing protocolsBhagyashri Dhoke
油
Routing protocols allow routers to communicate and exchange information that helps determine the best path between networks. The main types are static routing, where routes are manually configured, and dynamic routing, where routes are automatically updated as network conditions change. Common dynamic routing protocols include RIP, IGRP, EIGRP, and OSPF, which use different algorithms and metrics like hop count or bandwidth to calculate the best routes.Secure routing in DSR
Secure routing in DSRBirju Tank
油
This presentation helps you to understand how routing works in DSR Protocol in Ad-Hoc Networks. DSR protocols is used in Mobile Ad-hoc network.Load balancing in OSPF
Load balancing in OSPFArash Pourdamghani
油
This document discusses OSPF, load balancing, and ECMP. It begins with an overview of OSPF as an intra-AS routing protocol that uses the Dijkstra algorithm to find the shortest path. It then discusses the load balancing problem and how ECMP can provide a solution by equally splitting traffic across multiple equal-cost paths. The benefits of ECMP include load balancing, improved bandwidth utilization, and congestion mitigation. Traditional ECMP has drawbacks, but weighted ECMP can optimize end-to-end delay by distributing traffic based on pre-determined weight ratios.Improved dsr algo routing in manet
Improved dsr algo routing in manetmadhavsolanki
油
This document summarizes a research paper on designing an energy routing protocol called EPAR to optimize power consumption in mobile ad hoc networks (MANETs). EPAR aims to minimize total transmission energy and maximize network lifetime. It calculates the battery power for each path and selects the path with the maximum lowest hop energy. Simulation results show that EPAR outperforms the original DSR protocol by 65% and achieves higher throughput than DSR and another protocol called MTPR in different network scenarios. EPAR and MTPR also produce longer network lifetimes than DSR when considering factors like packet delivery ratio.VHDL Implementation of DSDV Ad-Hoc Routing Protocol
VHDL Implementation of DSDV Ad-Hoc Routing ProtocolIOSR Journals
油
Abstract: An Ad-Hoc network deals with the collection of mobile nodes without any centralized structure. This
can be well suited for environment where changes are frequent and establishment of infrastructure is not very
cost effective. In short it can turn the dream of anytime anywhere into reality[1]. Here we deal with the VHDL
implementation of DSDV(destination sequenced distance vector) routing protocol to fulfill these requirements of
Ad-hoc network more effectively.
Keywords: Adhoc, DSDV,FPGA,VHDL,Routing3.1 . 弌舒弍弍亠从仂于 亠仍亠仆舒 从仂仆仂仄亳从舒 亳 亠仍从仂亠 仂亰磺于仂
3.1 . 弌舒弍弍亠从仂于 亠仍亠仆舒 从仂仆仂仄亳从舒 亳 亠仍从仂亠 仂亰磺于仂Unison Group
油
弌亠亳 3. 舒弍仂舒 仗仂 亞仗仗舒仄. 弌亠从仂 "亠仄仍亠仗仂仍亰仂于舒仆亳亠"
-仆 舒舒 弌舒弍弍亠从仂于, 丕丶, 丕
仗亠亰亠仆舒亳亳 仗亠亟舒于仍亠仆舒 亳仆仂仄舒亳 仂 仄亠舒, 仆亠仂弍仂亟亳仄 亟仍 仆亳亢亠仆亳 仆亠亞舒亳于仆仂亞仂 于仂亰亟亠亶于亳 亠仍从仂亞仂 仂亰磺于舒, 仂 亠从亠仄 仂仂礌亳亳 仗舒弍亳 于 亞亰从仂亶 亠仗弍仍亳从亠; 舒仄仂亠仆 于仂亰仄仂亢仆仂亳 亳 弍舒亠 亟仍 舒亰于亳亳 亠仍从仂亞仂 仂亰磺于舒, 于 仂仄 亳仍亠 于 仂仄亠 仂亞舒仆亳亠从仂亞仂.Routing
RoutingSaima Azam
油
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.Geographical routing presentation
Geographical routing presentationApoorva Nagaraj
油
This document discusses geographical routing in mobile ad hoc networks. It describes traditional routing approaches like next-hop routing, source routing, and flooding, and their disadvantages. It then introduces geographical routing, which uses location information to route packets. Key geographical routing protocols discussed include LAR, DREAM, and GRID. LAR and DREAM disseminate location information and forward packets towards the destination's expected zone. GRID partitions the area into grids and elects gateways to route between grids towards the destination. The document also categorizes geographical routing algorithms based on their use of location services, forwarding strategies, and recovery schemes.
Computer networks network layer,routing
Computer networks network layer,routingDeepak John
油
Deepak John,SJCET-pala.Network Layer: Services of NW layer, Routing: Characteristics, performance criteria, routing strategies: fixed routing, flooding, random routing, Adaptive routing, congestion control
Switched WAN Virtual Circuit Switching, Global addressing, Virtual circuit identifier, Connection Setup:- Permanent Virtual Circuit, Switched Virtual Circuit, X.25
WAN, X.25 layers and protocols.Network Lifetime Analysis of Routing Protocols of Short Network in Qualnet
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
油
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc network have the attributes such as wireless connection, continuously changing topology, distributed operation and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive & hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed & battery consumption. It has been observed that RIP has better network lifetime than other.A study on performance comparison of dymo with aodv and dsr
A study on performance comparison of dymo with aodv and dsrIAEME Publication
油
This document summarizes and compares the performance of the DYMO, AODV, and DSR routing protocols for mobile ad hoc networks (MANETs). It finds that DYMO has the highest throughput as it avoids expiring good routes by appropriately updating route lifetimes. AODV shows higher throughput than DSR due to avoiding loops and maintaining fresh routes. DSR initially has very high packet loss, but this decreases substantially over time. The document analyzes the protocols based on metrics like throughput, packet loss, end-to-end delay, packet delivery fraction, and routing overhead.Recently uploaded (20)
LA2-64 -bit assemby language program to count number of positive and negative...
LA2-64 -bit assemby language program to count number of positive and negative...VidyaAshokNemade
油
This is one of lab experiment for Microprocessor Hackathon-Problem-Statements-Technology-Track-with-Link.pptx
Hackathon-Problem-Statements-Technology-Track-with-Link.pptxdatahiverecruitment
油
Hackathon-Problem-Statements-Technology-Track-with-Link.pptxAirport Components Part1 ppt.pptx-Site layout,RUNWAY,TAXIWAY,TAXILANE
Airport Components Part1 ppt.pptx-Site layout,RUNWAY,TAXIWAY,TAXILANEPriyanka Dange
油
RUNWAY,TAXIWAY,TAXILANEWhy the Engineering Model is Key to Successful Projects
Why the Engineering Model is Key to Successful ProjectsMaadhu Creatives-Model Making Company
油
In this PDF document, the importance of engineering models in successful project execution is discussed. It explains how these models enhance visualization, planning, and communication. Engineering models help identify potential issues early, reducing risks and costs. Ultimately, they improve collaboration and client satisfaction by providing a clear representation of the project.Machine Elements in Mechanical Design.pdf
Machine Elements in Mechanical Design.pdfSLatorreAndrs
油
Elementos importantes para el dise単o de elementos mec叩nicosLA11-Case study of motherboard and internal components of motheroard.docx
LA11-Case study of motherboard and internal components of motheroard.docxVidyaAshokNemade
油
Thisis case study of motherboardSIMULATION OF FIR FILTER BASED ON CORDIC ALGORITHM
SIMULATION OF FIR FILTER BASED ON CORDIC ALGORITHMVLSICS Design
油
Coordinate Rotation Digital Computer (CORDIC) discovered by Jack E Volder. It is a shift-add operation and iterative algorithm. CORDIC algorithm has wide area for several applications like digital signal processing, biomedical processing, image processing, radar signal processing, 8087 math coprocessor, the HP-35 calculator, Discrete Fourier, Discrete Hartley and Chirp-Z transforms, filtering, robotics, real time navigational system and also in communication systems. In this paper, we discussed about the CORDIC algorithm and CORDIC algorithm based finite impulse response low pass & high pass filter. We have generated the M-code for the CORDIC Algorithm and CORDIC Algorithm based FIR filter with the help of MATLAB 2010a.We also discussed about the frequency response characteristics of FIR filter.
Analysis of Daylighting in Interior Spaces using the Daylight Factor - A Manu...
Analysis of Daylighting in Interior Spaces using the Daylight Factor - A Manu...Ignacio J. J. Palma Carazo
油
Daylighting manual method based on Daylight Factor for indoor spaces, previous to any computational simulation method.Water Industry Process Automation & Control Monthly - April 2025
Water Industry Process Automation & Control Monthly - April 2025Water Industry Process Automation & Control
油
Welcome to the April 2025 edition of WIPAC Monthly, the magazine brought to you by the LInkedIn Group Water Industry Process Automation & Control.
In this month's issue, along with all of the industries news we have a number of great articles for your edification
The first article is my annual piece looking behind the storm overflow numbers that are published each year to go into a bit more depth and look at what the numbers are actually saying.
The second article is a taster of what people will be seeing at the SWAN Annual Conference next month in Berlin and looks at the use of fibre-optic cable for leak detection and how its a technology we should be using more of
The third article, by Rob Stevens, looks at what the options are for the Continuous Water Quality Monitoring that the English Water Companies will be installing over the next year and the need to ensure that we install the right technology from the start.
Hope you enjoy the current edition,
OliverDistillation Types & It's Applications 1-Mar-2025.pptx
Distillation Types & It's Applications 1-Mar-2025.pptxmrcr123
油
Distillation is a widely used method for separating mixtures油based on differences in the conditions required to change the油phase of components of the mixture.
To separate a mixture of liquids, the liquid can be heated to force components, which have different boiling points, into the gas phase. The gas is then condensed back into liquid form and collected.
Distillation can be considered as a physical separation process not a chemical reaction.
Distillation involves selective evaporation and subsequent condensation of a component in a liquid mixture.
It is a separation technique that can be used to either increase the concentration of a particular component in the mixture or to obtain (almost) pure components from the mixture.
Under a given pressure, the temperature at which a pure liquid distills (or boils) is known as Boiling Point .
Technically, the boiling point of a liquid is the temperature at which the vapor pressure of a liquid equals to the surrounding atmospheric pressure, allowing bubbles of vapor to form and rise through the liquid.油
Distillation allows one of the liquid mixture's components into a gaseous state, taking advantage of the difference in their boiling points.
Industry 4.0: Transforming Modern Manufacturing and Beyond
Industry 4.0: Transforming Modern Manufacturing and BeyondGtxDriver
油
This document explores the fundamental concepts, technologies, and applications of Industry 4.0. Topics include automation, IoT (Internet of Things), smart factories, cyber-physical systems, and the integration of AI and big data analytics in industrial processes. It serves as a comprehensive resource for students, professionals, and enthusiasts eager to delve into the fourth industrial revolution.Optimize AI Latency & Response Time with LLumo
Optimize AI Latency & Response Time with LLumosgupta86
油
Long response times kill user experience. We provide real-time monitoring and optimizations to ensure fast, seamless interactions.Supervised Learning Ensemble Techniques Machine Learning
Supervised Learning Ensemble Techniques Machine LearningShivarkarSandip
油
Supervised Learning Ensemble Techniques, Bagging-Random Forest trees, Voting types,Boosting -Ada boost, gradient boostingProduction Planning & Control and Inventory Management.pptx
Production Planning & Control and Inventory Management.pptxVirajPasare
油
Production Planning and Control : Importance, Objectives and Functions . Inventory Management - Meaning, Types , Objectives, Selective Inventory Control : ABC Analysis
he Wright brothers, Orville and Wilbur, invented and flew the first successfu...
he Wright brothers, Orville and Wilbur, invented and flew the first successfu...HardeepZinta2
油
The Wright brothers, Orville and Wilbur, invented and flew the first successful airplane in 1903. Their flight took place in Kitty Hawk, North Carolina. Virtual Power plants-Cleantech-Revolution
Virtual Power plants-Cleantech-RevolutionAshoka Saket
油
VPPs are virtual aggregations of distributed energy resources, such as energy storage, solar panels, and wind turbines, that can be controlled and optimized in real-time to provide grid services.Explainability and Transparency in Artificial Intelligence: Ethical Imperativ...
Explainability and Transparency in Artificial Intelligence: Ethical Imperativ...AI Publications
油
Artificial Intelligence (AI) is increasingly embedded in high-stakes domains such as healthcare, finance, and law enforcement, where opaque decision-making raises significant ethical concerns. Among the core challenges in AI ethics are explainability and transparencykey to fostering trust, accountability, and fairness in algorithmic systems. This review explores the ethical foundations of explainable AI (XAI), surveys leading technical approaches such as model-agnostic interpretability techniques and post-hoc explanation methods and examines their inherent limitations and trade-offs. A real-world case study from the healthcare sector highlights the critical consequences of deploying non-transparent AI models in clinical decision-making. The article also discusses emerging regulatory frameworks and underscores the need for interdisciplinary collaboration to address the evolving ethical landscape. The review concludes with recommendations for aligning technical innovation with ethical imperatives through responsible design and governance.Analysis of Daylighting in Interior Spaces using the Daylight Factor - A Manu...
Analysis of Daylighting in Interior Spaces using the Daylight Factor - A Manu...Ignacio J. J. Palma Carazo
油
Water Industry Process Automation & Control Monthly - April 2025
Water Industry Process Automation & Control Monthly - April 2025Water Industry Process Automation & Control
油
DYNAMIC SOURCE ROUTING (DSR)
- 2. Route Discovery in DSR Represents a node that receives RREQ for D from S Upon receiving a RREQ, the node takes the following actions: 1. The node is the target (Destination) o Returns a Route Reply (RREP) message to the sender o Copies the accumulated route record from RREQ into RREP o Sender upon receiving RREP, caches the route in its route cache for subsequent routing 2. The node is the intermediate node o The node discards this message, if 1. The message has the same ID i.e. has seen it before OR 2. Finds its own address in the route record o If Not, The node appends its own address to the route record in the ROUTE REQUEST message 1. Propagates the message to the next hop neighbours
- 3. Route Discovery in DSR