2018
DOI: 10.12720/jcm.13.4.175-181
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of AODV, DSR, and DSDV Routing Protocols in a Wireless Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 10 publications
0
4
0
1
Order By: Relevance
“…It is concluded that the AODV has the best performance when compared to other algorithms in terms of its ability to maintain a connection through periodic data exchange between nodes, and that it also performs better in networks with a higher number of nodes. He evaluated the comparison at different simulation times [2] using a number of performance matrices such as average throughput and end-to-end latency. Because node mobility is assumed to be very low, the PDR for AODV and DSDV is reduced, but the PDR for DSR is enhanced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…It is concluded that the AODV has the best performance when compared to other algorithms in terms of its ability to maintain a connection through periodic data exchange between nodes, and that it also performs better in networks with a higher number of nodes. He evaluated the comparison at different simulation times [2] using a number of performance matrices such as average throughput and end-to-end latency. Because node mobility is assumed to be very low, the PDR for AODV and DSDV is reduced, but the PDR for DSR is enhanced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…It is suited for MANET networks due to a number of advantageous features, such as dynamic, self-starting multi-hop routing between mobile nodes aiming to set up and maintain an ad hoc network [38]. AODV enables the evolution of routes to specific locations without requiring nodes to maintain these routes while not communicating [39]. Using objective sequence numbers, AODV circumvents the problem of "counting to infinity."…”
Section: Ad Hoc On-demand Distance Vector (Adov)mentioning
confidence: 99%
“…The two main aspects of the DSR routing protocol are route discovery and route maintenance. When sending packets over the DSR protocol, mobile hosts must first determine if they already have a route to the desired destination by checking their route cache [39]. A packet is sent to the host when the network contains the source-to-destination route.…”
Section: Dynamic Source Routing (Dsr)mentioning
confidence: 99%
“…After that, nodes will recalculate the routes to other nodes based on the updated topology information and the routing algorithm agreed in advance. Common active routing protocols, such as Optimized Link State Routing Protocol (OLSR) and Destination-Sequenced Distance Vector Protocol (DSDV) [4], use the above mechanism to update routing information.…”
Section: Introductionmentioning
confidence: 99%