Open AccessAODV, DSDV and OSLR Protocols Performance over MANET
Author(s) -
Amit Garg,
Ashish Kumar,
Amit K. Chaturvedi
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.f1379.0986s319
Subject(s) - computer network , computer science , optimized link state routing protocol , mobile ad hoc network , ad hoc on demand distance vector routing , destination sequenced distance vector routing , routing protocol , network packet , mobility model , distributed computing , node (physics) , distance vector routing protocol , network topology , wireless ad hoc network , link state routing protocol , topology (electrical circuits) , wireless , engineering , telecommunications , electrical engineering , structural engineering
As each mobile node of a MANET is treated as an autonomous peer, and the random mobility patterns of the mobile nodes need to be analyzed to obtain the performance of the continuously changing topology network. Many mobility models are designed and analyzed to the real-world scenarios with limited communication resources. MANETs belong to Wireless Networks where the nodes communicate with each other in a multi-hop fashion without any centralized control. Such network is infrastructure less, resource constrained, works in dynamic topology to provide communication. As routing performs a crucial role for obtaining the path from source to the destination, so mobility modeling and control makes the topology more challenging. Here, in this paper we have compared three routing protocols with AODV, DSDV, and OLSR for the ten samples by varying number of nodes and number of packets sent on the network and obtained the cases where these protocols perform best. OLSR performs well in the less crowd networks than the AODV and DSDV. AODV performs better than when the number of nodes is less than five in our sample.