Loading…
Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network
The Mobile Ad hoc Networks (MANETs) have been emerging as a technology offering many advantages to the users as regards cost and ease. The MANET is the collection of the connected mobile nodes and the connection is by the wireless links forming a temporary topology of network operating without centr...
Saved in:
Published in: | International journal of innovative technology and exploring engineering 2019-09, Vol.8 (11), p.3529-3535 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The Mobile Ad hoc Networks (MANETs) have been emerging as a technology offering many advantages to the users as regards cost and ease. The MANET is the collection of the connected mobile nodes and the connection is by the wireless links forming a temporary topology of network operating without centralized administration or the base station. Routing indicates a method by which information gets forwarded from transmitters to recipients. This is a strategy which guarantees the connection between two of the nodes in this network. For this work, there was a routing algorithm that was proposed for an efficient determination of an optimal path from the source to the destination in the MANETs. The Ad hoc On-Demand Distance Vector Routing (AODV) based protocol has been a routing protocol that has been designed for operating the MANET. This algorithm had been designed by means of using the TABU Search (TS) and the Shuffled Frog Leaping Algorithm (SFLA) which has been a metaheuristic algorithm that is a representation. The TABU_SFLA proposed had carried out two other operations generated in the neighbourhood for determining the optimal path and to minimize the time of execution. The results were compared to prove that the proposed TABU_SFLA was able to outperform all other algorithms that were well-suited for adapting the problem of routing optimization. |
---|---|
ISSN: | 2278-3075 2278-3075 |
DOI: | 10.35940/ijitee.K2482.0981119 |