TY - GEN
T1 - A Comparative Performance Analysis of AOMDV and PAR Algorithms for Mobile Ad Hoc Networks
AU - Suresh, Salini
AU - Manjunath, M.
AU - Ravikumar, K.
AU - Hanumanthappa, M.
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2021
Y1 - 2021
N2 - Mobile Ad hoc Networks (MANET) is centred on wireless networks that enable users to communicate and exchange information in a simple yet and effective method. Multipath routing is of great interest to MANETs with the salient feature of dynamic topology and distributed infrastructure. Ad hoc On-Demand Multipath Distance Vector is the enhancement of AODV (Ad hoc On-demand Distance Vector) protocol that establishes optimal routes which are link disjoint and loop-free and based on hop count as the metric value from source to the destination. Although many routing protocols are proposed for routing in MANET, discovering an optimal path between source and destination is a key problem. The Ant Colony Optimisation (ACO) also has a greater possibility of choosing the right and shortest path between two nodes. Petal Ant Routing is a metaheuristics, nature-inspired, reactive routing algorithm for effective multipath routing. This research work intents to perform a comparative analysis of conventional AOMDV and nature-inspired based PAR algorithm for routing in MANET.
AB - Mobile Ad hoc Networks (MANET) is centred on wireless networks that enable users to communicate and exchange information in a simple yet and effective method. Multipath routing is of great interest to MANETs with the salient feature of dynamic topology and distributed infrastructure. Ad hoc On-Demand Multipath Distance Vector is the enhancement of AODV (Ad hoc On-demand Distance Vector) protocol that establishes optimal routes which are link disjoint and loop-free and based on hop count as the metric value from source to the destination. Although many routing protocols are proposed for routing in MANET, discovering an optimal path between source and destination is a key problem. The Ant Colony Optimisation (ACO) also has a greater possibility of choosing the right and shortest path between two nodes. Petal Ant Routing is a metaheuristics, nature-inspired, reactive routing algorithm for effective multipath routing. This research work intents to perform a comparative analysis of conventional AOMDV and nature-inspired based PAR algorithm for routing in MANET.
UR - https://www.scopus.com/pages/publications/85116614718
UR - https://www.scopus.com/inward/citedby.url?scp=85116614718&partnerID=8YFLogxK
U2 - 10.1007/978-981-16-1941-0_58
DO - 10.1007/978-981-16-1941-0_58
M3 - Conference contribution
AN - SCOPUS:85116614718
SN - 9789811619403
T3 - Lecture Notes in Networks and Systems
SP - 585
EP - 592
BT - Proceedings of the 2nd International Conference on Computational and Bio Engineering, CBE 2020
A2 - Jyothi, S.
A2 - Mamatha, D.M.
A2 - Zhang, Yu-Dong
A2 - Raju, K. Srujan
PB - Springer Science and Business Media Deutschland GmbH
T2 - 2nd International Conference on Computational and Bioengineering, CBE 2020
Y2 - 4 December 2020 through 5 December 2020
ER -