Abstract
Problem statement: In this study, an attempt had been made to compare the performance of the reactive ad-hoc routing protocols using OPNE T modeler with respect to increasing number of nodes in the network. Approach: In present study, we compared various reactive rout ing protocols such as Ad hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA), on the basis of their throughput by increasing number of nodes in the network. Results: Comparative study of routing protocols on the basi s of throughput of a network on the basis of number of i ncreasing nodes in the network. Conclusion/Recommendations: Three routing protocols are being studied on the b asis of the throughput of the network with respect to the numbe r of increasing nodes in the network and had been concluded that TORA performs better for if the number of nodes in a network are increased.
Highlights
A Mobile Ad-hoc Network (MANET) is a multi hop wireless network formed by a group of mobile nodes that have wireless capabilities
This study provides a comparative study through simulation of three routing protocols (DSR, Ad hoc On-demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA)) for mobile ad-hoc networks using OPNET modeler
TORA does not engage in the route discovery again and again as it already have a Direct Allocation Graph (DAG) of all the nodes in the network
Summary
A Mobile Ad-hoc Network (MANET) is a multi hop wireless network formed by a group of mobile nodes that have wireless capabilities. The advantage of this strategy is that routes are adaptable to the dynamically changing environment of MANETs, since each node can update its routing table when they receiver fresher topology information and forward the data packets over fresher and better routes Under this category Dynamic Source Routing (DSR) protocol requires each packet to carry the full address (every hop in the route), from source to the destination. The protocol is composed of the two main mechanisms of “Route Discovery” and “Route Maintenance”, which work together to allow nodes to discover and maintain routes to arbitrary destinations in the ad hoc network This protocol has a number of advantages over routing protocols such as AODV, LMR and TORA and in small to moderately size networks (perhaps up to a few hundred nodes), this protocol may perform better. Throughput (bps): Represents the total number of bits forwarded to higher layers per second
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
